![]() |
![]() |
#111 |
Dec 2003
Hopefully Near M48
2×3×293 Posts |
![]()
21169397 0x746B874910048A__ curtisc grn16-11
22776563 0xCF3C3B04BD5A10__ curtisc wde3100-028 24036583 0x7EC80125B6DB7E__ jfindley M3 23393483 0xD9BFF123AAE613__ mesirow DellH Those are the four candidates. |
![]() |
![]() |
#112 | |
Sep 2003
Borg HQ, Delta Quadrant
2×33×13 Posts |
![]() Quote:
|
|
![]() |
![]() |
#113 | |
Mar 2004
3·11 Posts |
![]() Quote:
|
|
![]() |
![]() |
#114 |
22·7·181 Posts |
![]()
I have cross referenced my general Mersenne estimations and found that:
2^23393483-1 Should be Prime! This is my non-encrypted guess, based upon the pre-screened candidates given by Y'all. ![]() |
![]() |
#115 |
Dec 2003
Hopefully Near M48
2·3·293 Posts |
![]()
How's the factoring going?
|
![]() |
![]() |
#116 |
"Mike"
Aug 2002
24·499 Posts |
![]()
9,000,000...
|
![]() |
![]() |
#117 | |
Dec 2003
E16 Posts |
![]() Quote:
|
|
![]() |
![]() |
#118 |
Dec 2003
Hopefully Near M48
2×3×293 Posts |
![]()
I estimate that his average per iteration time is about 0.046s, judging by his posts.
In fact, that's about the same per iteration time as my computer when I close down everything and its working on a 20.3M exponent. And I'm using a P4 too! Last fiddled with by jinydu on 2004-05-20 at 13:08 |
![]() |
![]() |
#119 |
P90 years forever!
Aug 2002
Yeehaw, FL
11100101111112 Posts |
![]()
Jeff is leading the race in the official different-hardware different-software test. He matches xyzzy at 3,000,000 iterations.
|
![]() |
![]() |
#120 |
May 2004
22×7 Posts |
![]()
Oh, sure. You are absolutely right. In fact, I know that all divisors of 2^N-1 are of the form 2kN+-1 for an integer k - I forgot the sign, but only one sign is correct... This makes it clear that these numbers are not only odd, but they are not multiple of any small prime.
This makes the numbers 2^N-1 seemingly much more frequent, and I wonder why the original conjecture works so well... Well, let me admit that I believe that the statement with the sqrt(2) limit might still be correct, and therefore what you say - even though it is true - is compensated by something else, so that it is still legitimate to use this statistical reasoning. OK, let me withdraw the word "theorem". ;-) do you have a different specific idea whether the limit exists, and what it is? Lubos Motl - I had to change my username because LumĂdek can't be logged in (probably a bug with the 8bit characters). |
![]() |
![]() |
#121 |
"Phil"
Sep 2002
Tracktown, U.S.A.
45E16 Posts |
![]()
No factor found on M21169397:
[Thu May 20 09:42:36 2004] M21169397 completed P-1, B1=525000, B2=8400000, WZ1: 234E1D80 Does anyone have an estimate of the chances of finding a factor if I increase B2 again? I suspect it is pretty small, but would be curious to find out. |
![]() |
![]() |
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 |