mersenneforum.org POST LOTS AND LOTS OF PRIMES HERE
 Register FAQ Search Today's Posts Mark Forums Read

 2010-04-04, 16:56 #12 pb386     Nov 2003 130410 Posts 1239*2^815957-1 (245631 digits)
 2010-04-05, 12:42 #13 amphoria     "Dave" Sep 2005 UK 2×19×73 Posts 4067*2^568776-1 (171223 digits) 4063*2^569491-1 (171438 digits)
 2010-04-05, 19:13 #14 pb386     Nov 2003 101000110002 Posts 1253*2^817490-1 (246093 digits) 1137*2^817593-1 (246124 digits) 1085*2^817644-1 (246139 digits)
 2010-04-06, 18:08 #15 amphoria     "Dave" Sep 2005 UK AD616 Posts 2185*2^764875-1 (230254 digits) 1405*2^765505-1 (230444 digits)
 2010-04-07, 05:18 #16 amphoria     "Dave" Sep 2005 UK 2·19·73 Posts 2093*2^765710-1 (230505 digits)
 2010-04-07, 22:29 #17 amphoria     "Dave" Sep 2005 UK 2·19·73 Posts 9th Drive: 29445*2^627251-1
 2010-04-09, 04:22 #18 amphoria     "Dave" Sep 2005 UK 1010110101102 Posts 9th Drive: 14895*2^627529-1 (188910 digits)
 2010-04-09, 16:25 #19 amphoria     "Dave" Sep 2005 UK 2·19·73 Posts 4039*2^571923-1 (172170 digits)
 2010-04-09, 16:57 #20 Cruelty     May 2005 65216 Posts 59*2^3408416-1 (1026038 digits) so far it's the smallest known megaprime Verification using PFGW: Code: Primality testing 59*2^3408416-1 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Running N+1 test using discriminant 7, base 6+sqrt(7) Running N+1 test using discriminant 7, base 10+sqrt(7) Special modular reduction using FFT length 224K on 59*2^3408416-1 Calling N+1 BLS with factored part 100.00% and helper 0.00% (300.00% proof) 59*2^3408416-1 is prime! (110852.6366s+0.0192s)
2010-04-09, 17:41   #21
VBCurtis

"Curtis"
Feb 2005
Riverside, CA

33×5×31 Posts

Quote:
 Originally Posted by Cruelty 59*2^3408416-1 (1026038 digits) so far it's the smallest known megaprime Verification using PFGW: Code: Primality testing 59*2^3408416-1 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Running N+1 test using discriminant 7, base 6+sqrt(7) Running N+1 test using discriminant 7, base 10+sqrt(7) Special modular reduction using FFT length 224K on 59*2^3408416-1 Calling N+1 BLS with factored part 100.00% and helper 0.00% (300.00% proof) 59*2^3408416-1 is prime! (110852.6366s+0.0192s)
Wowwwwwwwww.
Nice find, sir.
-Curtis

2010-04-09, 21:26   #22
Beyond

Dec 2002

22·3·37 Posts

Quote:
 Originally Posted by Cruelty 59*2^3408416-1 (1026038 digits) so far it's the smallest known megaprime Verification using PFGW: Code: Primality testing 59*2^3408416-1 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Running N+1 test using discriminant 7, base 6+sqrt(7) Running N+1 test using discriminant 7, base 10+sqrt(7) Special modular reduction using FFT length 224K on 59*2^3408416-1 Calling N+1 BLS with factored part 100.00% and helper 0.00% (300.00% proof) 59*2^3408416-1 is prime! (110852.6366s+0.0192s)
Congrats!

 Similar Threads Thread Thread Starter Forum Replies Last Post 2147483647 YAFU 3 2016-12-25 21:44 TheMawn Software 18 2014-08-16 03:54 lsoule Riesel Prime Search 1999 2010-03-17 22:33 Peter Hackman Factoring 2 2008-08-15 14:26 jasong Information & Answers 4 2007-10-04 20:40

All times are UTC. The time now is 12:17.

Sun May 31 12:17:06 UTC 2020 up 67 days, 9:50, 1 user, load averages: 2.81, 6.16, 4.33