mersenneforum.org > Math Seventeen or Bust found a prime!
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2005-01-03, 15:31 #1 Mystwalker     Jul 2004 Potsdam, Germany 3·277 Posts Seventeen or Bust found a prime! No year without December prime! 28433*2^7830457+1 is prime. 2,357,207 digits, making it the fourth-largest known so far! More under http://www.seventeenorbust.com and http://www.free-dc.org/forum/showthr...&threadid=8238 7 down, 10 to go!
2005-01-03, 17:16   #2
Jean Penné

May 2004
FRANCE

22×5×29 Posts
Seventeen or Bust found a prime !

Quote:
 Originally Posted by Mystwalker No year without December prime! 28433*2^7830457+1 is prime. 2,357,207 digits, making it the fourth-largest known so far! More under http://www.seventeenorbust.com and http://www.free-dc.org/forum/showthr...&threadid=8238 7 down, 10 to go!
Splendid news ! Congratulation for the happy finder, and for all participants !

Jean

 2005-01-03, 18:29 #3 Citrix     Jun 2003 2·7·113 Posts Congrats from PSP's side also. Citrix
 2005-01-03, 19:26 #4 Citrix     Jun 2003 158210 Posts Forgot to mention that the above k is prime, hence it reduces a k for PSP. Citrix
 2005-01-04, 01:49 #5 Xyzzy     "Mike" Aug 2002 7·11·107 Posts
 2005-01-04, 17:00 #6 David John Hill Jr     Jun 2003 Pa.,U.S.A. C416 Posts glad for success There should be a lot more to find after the first 17. Thought I was reading about einsteins ring being convex at first.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post Mark Rose Lounge 35 2017-03-02 00:39 philmoore Lounge 6 2014-05-26 23:10 paulunderwood 3*2^n-1 Search 61 2008-04-22 12:19 VJS Lounge 3 2005-10-20 05:55 wblipp Lounge 4 2003-12-16 21:08

All times are UTC. The time now is 14:16.

Tue Aug 3 14:16:08 UTC 2021 up 11 days, 8:45, 1 user, load averages: 3.54, 3.74, 3.76

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.