Hi,
I just tried a quick run of Georges new P-1 code on M(M(17)), and lo!
[cut]
At prime 499549. Time thusfar 1707.604 sec. (341520836670 clocks)
Stage 1 complete. 365804 transforms. Time: 1717.294 sec. (343458751180
clocks)
Stage 1 GCD complete. Time: 19.737 sec. (3947333454 clocks)
M131071 has a factor: 14899621191992882743
That wan't hard. But one thing puzzles me:
P-1 = 2*3*61*6229*131071*49861943
The factor was found after stage 1 with a limit of 500000 - how can it
find a factor which is 1 mod (49861943) ? Another magic trick by George?
Ciao,
Alex.
> I checked Chris Caldwell's pages on this, and Curt Noll's trial-factored
> M(M(127)) to 5.10^50, surprisingly low considering the size of M(127)
> itself, I noticed many other M(M(p)) as listed in
> http://www.garlic.com/~wedgingt/MMPstats.txt have only been tested to very
> low limits indeed.
>
> I wondered why there wasn't more work done on these - though I understand
> it's very hard to motivate people when Guy's law of small numbers no doubt
> applies, but everything M(M(61)) and above is currently unknown. It would be
> nice to see a few more results there.
>
> Chris
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
