![]() |
![]() |
#397 |
Aug 2002
Portland, OR USA
2·137 Posts |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |
#398 |
Sep 2003
Borg HQ, Delta Quadrant
2×33×13 Posts |
![]()
GAH! Someone edit that last post and get rid of some of those bananas! They're wasting FAR too many CPU cycles!
![]() |
![]() |
![]() |
#399 | |
Bemusing Prompter
"Danny"
Dec 2002
California
1001001111002 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
#400 |
Dec 2003
Hopefully Near M48
2·3·293 Posts |
![]()
F333 is the first Fermat number bigger than a googolplex.
But in order for a Mersenne number to be bigger than a googolplex, the exponent most be over 3.32192809 googol! |
![]() |
![]() |
#401 | |
Aug 2002
1101102 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
#402 |
May 2004
2×37 Posts |
![]()
Satisfying the New Mersenne Conjecture
Finally, 58*13466917+1 divides (2^13466917+1)/3, so the NMC remains alive. Another result - 486*24036583+1 divides (2^24036583+1)/3, so the New Mersenne Conjecture still holds. |
![]() |
![]() |
#403 |
May 2004
2·37 Posts |
![]()
Here is what they establish the New Mersenne Conjecture.
Let p be any odd natural number. If two of the following conditions hold, then so does the third: 1) p = 2^k +/- 1 or p = 4^k +/- 3 2) 2^p - 1 is a prime 3) (2^p + 1)/3 is a prime |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
When will the first 10 million digit prime be reported? | Uncwilly | Lounge | 13 | 2009-07-22 13:56 |
47th Mersenne prime reported! | ixfd64 | Lounge | 1 | 2009-06-10 16:14 |
41st Mersenne Prime found? | Unregistered | Data | 4 | 2004-05-21 10:08 |
41st Mersenne Prime Found??? | Prime95 | Lounge | 52 | 2004-03-23 20:06 |
40th Known Mersenne Prime Reported!! | Citrix | Lounge | 28 | 2003-12-21 19:42 |