![]() |
![]() |
#12 |
Nov 2003
70468 Posts |
![]()
New record Woodall :surprised What a surprise!
![]() 1268979*2^1268979-1 (382007 digits) Discovered by W. Siemelink using LLR (L201). Congrats! |
![]() |
![]() |
![]() |
#14 |
Feb 2007
24·33 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...? |
![]() |
![]() |
![]() |
#15 |
May 2005
22·11·37 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. |
![]() |
![]() |
![]() |
#16 |
May 2005
110010111002 Posts |
![]() |
![]() |
![]() |
![]() |
#17 | |
Jan 2006
Hungary
22·67 Posts |
![]() Quote:
Willem. |
|
![]() |
![]() |
![]() |
#18 |
May 2005
22·11·37 Posts |
![]()
Congratulations!!!
|
![]() |
![]() |
![]() |
#19 |
Nov 2003
E2616 Posts |
![]()
Jeff (L399) of TPS dumped alone about 60 primes at n=333,333 yestreday
![]() ![]() |
![]() |
![]() |
![]() |
#20 |
Nov 2003
E2616 Posts |
![]()
Congrats to Maks and his son on new largest repunit PRP:
(10^270343-1)/9 |
![]() |
![]() |
![]() |
#22 |
"Curtis"
Feb 2005
Riverside, CA
2×5×563 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 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Distribution of Mersenne primes before and after couples of primes found | emily | Math | 35 | 2022-12-21 16:32 |
Mersenne Primes p which are in a set of twin primes is finite? | carpetpool | Miscellaneous Math | 4 | 2022-07-14 02:29 |
Patterns in primes that are primitive roots / Gaps in full-reptend primes | mart_r | Prime Gap Searches | 14 | 2020-06-30 12:42 |
Conjecture about Mersenne primes and non-primes v2 | Mickey1 | Miscellaneous Math | 1 | 2013-05-30 12:32 |
possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |