mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 332
Search took 0.05 seconds.
Search: Posts Made By: carpetpool
Forum: Msieve 2022-01-05, 06:45
Replies: 4
Views: 232
Posted By carpetpool
Post Thanks, your suggestion seemed to work. Also, is...

Thanks, your suggestion seemed to work. Also, is the same true for NFS (YAFU better than Msieve), presumably for 130+ digits?
Forum: Msieve 2022-01-04, 04:54
Replies: 4
Views: 232
Posted By carpetpool
Post Msieve Quadratic Sieve error

I am (somewhat) new to using Msieve (and factoring projects too), I am trying to factor this random semiprime as a performance test, and I get the following error:

Mon Jan 03 20:08:41 2022 Msieve...
Forum: Conjectures 'R Us 2022-01-01, 18:59
Replies: 1,014
Views: 129,788
Posted By carpetpool
Thumbs up A good start...

A good start (https://primes.utm.edu/primes/page.php?id=133119) to a new year. :smile:
Forum: Factoring 2021-12-28, 21:28
Replies: 1
Views: 329
Posted By carpetpool
Post Significance of 'strong primes'?

This is more of a theoretical question, but what is the importance of a 'strong prime', specifically, the second property illustrated on the Wikipedia page here...
Forum: Miscellaneous Math 2021-11-12, 00:10
Replies: 4
Views: 508
Posted By carpetpool
Post As per that post, I can see the argument made...

As per that post, I can see the argument made against my original claim (not that it's incorrect, but rather contradicting).

The probability of Mp = 2^p-1 being prime is C/p where C is a...
Forum: Miscellaneous Math 2021-11-10, 05:09
Replies: 4
Views: 508
Posted By carpetpool
Post Mersenne prime exponents that are also Sophie Germain primes

So I stumbled on A065406 (http://oeis.org/A065406) by curiosity, and somewhere in the comments said this list was expected to be finite.

Basically, the number of primes p such that 2*p+1 and 2^p-1...
Forum: carpetpool 2021-11-08, 17:02
Replies: 1
Views: 306
Posted By carpetpool
Post Some T5K prime ideas

So most primes on the T5K list as you all might know are primes of the form k*b^n+-1 where k and b are rather small.

While I haven't searched for many primes in a long time, I thought of trying...
Forum: Conjectures 'R Us 2021-10-01, 23:04
Replies: 967
Views: 122,677
Posted By carpetpool
Post Back at it again... Will reserve S157. I...

Back at it again...

Will reserve S157. I plan to get at least to 400k on it but may go further... it depends.
Forum: sweety439 2021-01-09, 21:44
Replies: 284
Views: 29,948
Posted By carpetpool
Post Here's a suggestion: Instead of constantly...

Here's a suggestion:

Instead of constantly posting search limits and reservations that can be done in minutes, use a doc or pdf instead. Attach or provide the link in a single post. If you need...
Forum: Math 2021-01-08, 03:31
Replies: 26
Views: 5,495
Posted By carpetpool
Post Déjà...

Déjà (https://www.mersenneforum.org/showpost.php?p=563216&postcount=3) vu (https://www.mersenneforum.org/showthread.php?p=563218)?
Forum: carpetpool 2021-01-03, 22:16
Replies: 1
Views: 1,650
Posted By carpetpool
Post The examples involving Trinomial Coefficients and...

The examples involving Trinomial Coefficients and Catalan numbers (also see here (https://en.wikipedia.org/wiki/Catalan_pseudoprime)) are examples of P-recursive sequences, which is what I am...
Forum: carpetpool 2020-12-30, 09:50
Replies: 1
Views: 1,650
Posted By carpetpool
Post Computation of P-Recursive Sequences in Polynomial Time

Is it possible for centered trinomial coefficients (https://mathworld.wolfram.com/CentralTrinomialCoefficient.html) to be computed in O(log n) time, analogous to how the time complexity of modular...
Forum: Riesel Prime Search 2020-12-12, 09:08
Replies: 301
Views: 54,082
Posted By carpetpool
Post Very interesting, indeed. The prime in...

Very interesting, indeed.

The prime in question does not appear to be totally random?

I have actually constructed large random provable primes before (over 100,000 digits), but none of them...
Forum: And now for something completely different 2020-12-08, 06:31
Replies: 40
Views: 18,402
Posted By carpetpool
Post You can test them with LLR, you will just need to...

You can test them with LLR, you will just need to format your candidates to a NewPGEN type header. Here is an example for n*3^n+1:

200000:P:1:3:257
32 32
34 34
54 54
76 76
114 114
128 128...
Forum: Abstract Algebra & Algebraic Number Theory 2020-12-02, 21:19
Replies: 8
Views: 9,617
Posted By carpetpool
Then write up a paper explaining your...

Then write up a paper explaining your conjectures, and provide more evidence for your claims, like I have given or some of your own research.
Forum: Abstract Algebra & Algebraic Number Theory 2020-11-30, 00:44
Replies: 8
Views: 9,617
Posted By carpetpool
Finding the expected number of primes of...

Finding the expected number of primes of (k*b^n+c)/gcd(k+c,b-1) shouldn't be much different than finding the expected number of primes of the form k*b^n+c. If we treat numbers of the form k*b^n+c as...
Forum: Five or Bust - The Dual Sierpinski Problem 2020-11-17, 21:23
Replies: 8
Views: 10,741
Posted By carpetpool
Post I would happily certify it if I had the...

I would happily certify it if I had the resources. Unfortunately for Primo (which can run about 64 concurrent tasks at a time), the time complexity for certifying N prime is at least O(ln(N)^4). I...
Forum: Miscellaneous Math 2020-11-17, 20:54
Replies: 21
Views: 2,081
Posted By carpetpool
Post There appear to be a handful of pseudoprimes...

There appear to be a handful of pseudoprimes without the BPSW requirement:

for(n=1,30000, if(n%2==1 & isprime(n)==0, for(a=1,n, if(kronecker(a^2-4,n)==(-1) & kronecker(a^4-8*a^2+12,n)==(-1) &...
Forum: Conjectures 'R Us 2020-10-12, 05:34
Replies: 967
Views: 122,677
Posted By carpetpool
Post S223 is complete to n=30k. Primes attached.

S223 is complete to n=30k. Primes attached.
Forum: FermatSearch 2020-10-05, 04:27
Replies: 345
Views: 86,407
Posted By carpetpool
Post Congrats on a World Record Fermat Divisor! ...

Congrats on a World Record Fermat Divisor!

:bounce wave:

PrimeGrid has held the record for many years up until now...

Way to go!
Forum: Software 2020-10-04, 22:39
Replies: 6
Views: 2,141
Posted By carpetpool
Post Thanks for the suggestions! I ran 4 subsequent...

Thanks for the suggestions! I ran 4 subsequent instances of LLR --- assigning affinity to CPUS 0, 2.

The time increased by about 0.120 ms which I guess makes sense given that more cores means...
Forum: Software 2020-10-03, 21:16
Replies: 6
Views: 2,141
Posted By carpetpool
Post LLR Affinity Problem

I know there's a way to run different LLR instances and have them assigned to different designated CPU, making it run significantly faster than if only one instance were used.

I am using a 4 core,...
Forum: GPU Computing 2020-10-02, 21:41
Replies: 1
Views: 2,195
Posted By carpetpool
Post LLR GPU application

Hi,


I'm wondering if the GPU LLR software found at Jean Penne's website (http://jpenne.free.fr/index2.html) is in progress or of any use.




I've installed CUDA Toolkit 11.1...
Forum: Miscellaneous Math 2020-09-20, 00:04
Replies: 118
Views: 30,167
Posted By carpetpool
Post The pseudoprimes associated with r=1 are just...

The pseudoprimes associated with r=1 are just those 2-SPRPs congruent to 3 mod 4. We need some way to avoid trivial cases. As you suggest, gcd(2^r-2,n)=1 is a good requirement. Whether my claim could...
Forum: Miscellaneous Math 2020-09-19, 08:35
Replies: 118
Views: 30,167
Posted By carpetpool
I retract my original claim (but perhaps...

I retract my original claim (but perhaps something better could be turned out of it). Here are some counterexamples I just found using specific parameters b = 2, r = 1, s = 2. Trivially,...
Showing results 1 to 25 of 332

 
All times are UTC. The time now is 11:48.


Wed Jan 26 11:48:32 UTC 2022 up 187 days, 6:17, 0 users, load averages: 1.02, 1.22, 1.32

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔