![]() |
![]() |
#23 |
Nov 2003
2×1,811 Posts |
![]()
It is really a pretty grouping, but GFs are very heavy weight, therefore I don't think it's unusual.
As for the speed, Proth.exe was specifically optimized for GF's. Maybe LLR is faster only for small k's. But Proth.exe has a limit on base b (in b^2^k+1), for k=16 I think it's about 2M (so only b<2M can be tested). As for the status of GF search, I think all values have been already extensively sieved and all them have been reserved but some people never completed their reserved ranges. Furthermore, about 2 years ago Yves Gallot who crated Proth.exe disappeared from the prime searching community, and since about that time GF projects began to lose popularity. BTW, the account is not anonymous, it's written in the disclaimer that they were found by Dirk Schlueter who doesn't have an account on Top-5000. Most likely prof Caldwell found out about them through his private channels. Last fiddled with by Kosmaj on 2007-08-06 at 01:33 |
![]() |
![]() |
![]() |
#24 |
Nov 2003
2×1,811 Posts |
![]()
I just realized that Dirk's bases are at the 17M level, which means he didn't use Proth.exe, but most likely genefer80, another software written by Yves Gallot which can work with a base of any size. But it's much slower than Proth.exe because it is simulating 80-bit floating point precision in software. New 64-bit cpu's support 80-bit fp arithmetic nativelly but as I said Yves is not around to do the changes.
|
![]() |
![]() |
![]() |
#25 |
Mar 2006
Germany
56108 Posts |
![]()
251749*2^2013995-1 is the new No.1 Woodall Prime (606279 digits)!
|
![]() |
![]() |
![]() |
#26 |
May 2005
22·11·37 Posts |
![]() |
![]() |
![]() |
![]() |
#27 |
Nov 2004
California
23×3×71 Posts |
![]()
With a k without a 3 or a 5 in it
![]() |
![]() |
![]() |
![]() |
#28 |
I quite division it
"Chris"
Feb 2005
England
31×67 Posts |
![]()
From his website:
"Currently we are focusing on fixed n candidates, which are faster than fixed k searches" |
![]() |
![]() |
![]() |
#29 |
May 2005
162810 Posts |
![]()
Looks like another record Woodall prime for Primegrid
![]() |
![]() |
![]() |
![]() |
#30 |
Nov 2003
2·1,811 Posts |
![]()
Yes, amazing, the previous one also at the 2M level was found less than a month ago...
|
![]() |
![]() |
![]() |
#31 |
Nov 2003
2·1,811 Posts |
![]()
SOB striked again, with a huge prime
33661*2^7031232+1 with more than 2.1 M digits ![]() |
![]() |
![]() |
![]() |
#32 | |
May 2007
Kansas; USA
2·23·233 Posts |
![]() Quote:
Way to go seventeen-or-bust!! That makes a good case for double-checking I'd say! ![]() |
|
![]() |
![]() |
![]() |
#33 |
Nov 2003
2·1,811 Posts |
![]()
Congrats to Andy Steward on 3 new generalized rep-units in top-10! The largest one:
(13096^5953-1)/13095, 24506 digits is currently second largest, about 1500 digits more than the GRU found by Larry and me 2 years ago (the world record at the time), which is now 3rd. For each of his proven GRUs Andy provides a detailed commentary, so that with little self-study everybody can try to enter the field and find his first GRU. The commentary for the above prime can be found here. However, beware that entering Top-20 is not easy! Kosmaj Last fiddled with by Kosmaj on 2007-11-07 at 12:41 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Patterns in primes that are primitive roots / Gaps in full-reptend primes | mart_r | Prime Gap Searches | 14 | 2020-06-30 12:42 |
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 |
possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |