![]() |
![]() |
#1 |
(loop (#_fork))
Feb 2006
Cambridge, England
18EF16 Posts |
![]()
I'm getting a strong feeling that M1009 is an SNFS number (and would be quite a difficult SNFS number, a hundred CPU-years with awkwardly large per-CPU memory requirements); so how about doing things which are more likely to be tractable?
There are three 2^p-1 with p<1000 for which not all factors are known: 929, 947 and 991. They're all SNFS jobs, they're not especially exciting SNFS jobs but they are in the tractable range. M929 is Wagstaff's current most-wanted. How about we try as a forum to get all three done by the end of 2012? |
![]() |
![]() |
![]() |
#2 |
Nov 2003
22·5·373 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
Sep 2008
Kansas
22×829 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Countdown to Zero. | jwaltos | Science & Technology | 2 | 2016-12-29 00:19 |
Countdown primes | lavalamp | Puzzles | 12 | 2012-09-22 01:41 |
Countdown meter | gd_barnes | No Prime Left Behind | 14 | 2010-12-07 11:55 |
Best countdown problem ever | davieddy | Puzzles | 22 | 2009-01-26 13:46 |
Prime Countdown | Orgasmic Troll | Lounge | 7 | 2007-09-22 01:24 |