Other Primes - Page 2

Kosmaj · 2007-01-26, 01:37

New record Woodall :surprised What a surprise!

1268979*2^1268979-1 (382007 digits)

Discovered by W. Siemelink using LLR (L201). Congrats!

Cruelty · 2007-02-14, 22:02

Check this out. k>60bit found using LLR

m_f_h · 2007-03-15, 17:40

I hope my post won't clutter up this thread too much ; my excuses in advance if so, and moderators, please move it to wherever it should be if this place is not OK !
I just discovered the existence of LLR.
Is the search for GM's somewhere somehow coordinated ?
(People declaring to search some ranges...)
To what extend are the gmfcandidates prefactored or elsehow selected ?
I just ran llr somehow randomly on such a candidate and it IMMEDIATELY (time << 1 second) found a factor (2^16666417-...+1 has factor 18068995989053)
- how comes that this easy finding is not mentioned in the gmfcand... file while other bigger factors are there ?
Again sorry for my ignorance and maybe inappropriate posting...
PS: the llr program does not seem to write a save file when it's killed, like mprime...?

Cruelty · 2007-03-15, 23:13

gmfcandidates is prefactored to 32 bits for both GM and GQ, meaning that only if a factor is found for both such an exponent has been eliminated... however by default LLR will look only for GMs so only GM factors will be reported. Check out LLR documentation for details.

BTW: when exiting LLR it will always save it's current progress.

Cruelty · 2007-06-08, 08:35

New Woodall record

Siemelink · 2007-06-08, 09:43

Quote:

Originally Posted by Cruelty

New Woodall record

I am very happy. I've found now two Woodall primes in 10 months. Allthough the first two months I was unaware that they are called Woodall primes and that I wasn't the first to think of their special form n*2^n-1.

Willem.

Cruelty · 2007-06-08, 13:07

Congratulations!!!

Kosmaj · 2007-06-27, 06:39

Jeff (L399) of TPS dumped alone about 60 primes at n=333,333 yestreday

One more such dump and he will be in top-10 by number!

Kosmaj · 2007-07-21, 22:10

Congrats to Maks and his son on new largest repunit PRP:

(10^270343-1)/9

Cruelty · 2007-08-04, 20:31

3 Generalized Fermat primes have been reported under an anonymous account first, second, third - congrats!

VBCurtis · 2007-08-05, 03:07

Those 3 are a pretty fortunate grouping! I'd ask "what are the chances?", but knowing this forum, someone would actually calculate it.

Anyone know if primality testing generalized fermats is faster or slower than LLR for same-size riesel numbers?

-Curtis

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Mersenne Primes p which are in a set of twin primes is finite?	carpetpool	Miscellaneous Math	3	2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found	emily	Math	34	2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2	Mickey1	Miscellaneous Math	1	2013-05-30 12:32
A conjecture about Mersenne primes and non-primes	Unregistered	Information & Answers	0	2011-01-31 15:41
possible primes (real primes & poss.prime products)	troels munkner	Miscellaneous Math	4	2006-06-02 08:35

2007-01-26, 01:37	#12
Kosmaj Nov 2003 7046₈ Posts	New record Woodall :surprised What a surprise! 1268979*2^1268979-1 (382007 digits) Discovered by W. Siemelink using LLR (L201). Congrats!

2007-02-14, 22:02	#13
Cruelty May 2005 2³·7·29 Posts	Check this out. k>60bit found using LLR

2007-03-15, 17:40	#14
m_f_h Feb 2007 2⁴·3³ Posts	I hope my post won't clutter up this thread too much ; my excuses in advance if so, and moderators, please move it to wherever it should be if this place is not OK ! I just discovered the existence of LLR. Is the search for GM's somewhere somehow coordinated ? (People declaring to search some ranges...) To what extend are the gmfcandidates prefactored or elsehow selected ? I just ran llr somehow randomly on such a candidate and it IMMEDIATELY (time << 1 second) found a factor (2^16666417-...+1 has factor 18068995989053) - how comes that this easy finding is not mentioned in the gmfcand... file while other bigger factors are there ? Again sorry for my ignorance and maybe inappropriate posting... PS: the llr program does not seem to write a save file when it's killed, like mprime...?

2007-03-15, 23:13	#15
Cruelty May 2005 11001011000₂ Posts	gmfcandidates is prefactored to 32 bits for both GM and GQ, meaning that only if a factor is found for both such an exponent has been eliminated... however by default LLR will look only for GMs so only GM factors will be reported. Check out LLR documentation for details. BTW: when exiting LLR it will always save it's current progress.

2007-06-08, 08:35	#16
Cruelty May 2005 2³·7·29 Posts	New Woodall record

2007-06-08, 13:07	#18
Cruelty May 2005 2³×7×29 Posts	Congratulations!!!

2007-06-27, 06:39	#19
Kosmaj Nov 2003 2×1,811 Posts	Jeff (L399) of TPS dumped alone about 60 primes at n=333,333 yestreday One more such dump and he will be in top-10 by number!

2007-07-21, 22:10	#20
Kosmaj Nov 2003 2×1,811 Posts	Congrats to Maks and his son on new largest repunit PRP: (10^270343-1)/9

2007-08-04, 20:31	#21
Cruelty May 2005 1624₁₀ Posts	3 Generalized Fermat primes have been reported under an anonymous account first, second, third - congrats!

2007-08-05, 03:07	#22
VBCurtis "Curtis" Feb 2005 Riverside, CA 2⁶·73 Posts	Those 3 are a pretty fortunate grouping! I'd ask "what are the chances?", but knowing this forum, someone would actually calculate it. Anyone know if primality testing generalized fermats is faster or slower than LLR for same-size riesel numbers? -Curtis