![]() |
|
|
#12 |
|
"Phil"
Sep 2002
Tracktown, U.S.A.
3·373 Posts |
Updated list, Cunningham numbers < 768 bits:
5- : 317, 323 6- : 283 6+ : 284, 292 7- : 263, 269, 271 7+ : 268 |
|
|
|
|
#13 | |
|
Nov 2003
22·5·373 Posts |
Quote:
For at least the time being I can't help as I have (virtually) no resources. They total just a single PC and a laptop. [plus another PC some weekends] An alternate goal might be to finish base 2 to 800 bits????? |
|
|
|
|
|
#14 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
|
|
|
|
|
#15 | |
|
Jun 2005
lehigh.edu
210 Posts |
Quote:
Of course 768-bits assures difficulty < 234, but the nine remaining are very closely grouped in difficulty, at 220 (6,283-) to difficulty 229 (7, 271-). The two c16x's (7,263- c161 and 6,284+ c168) have had 2*t50, and are presumably ready for sieving. The three in c170-c189 are still running, and also at 2*t50. Looks like two in c190-c219, and two more at c224, c225. These are still just at 1.0*t50; suppose I could paste the four of them onto the c170-c189, difficulty above 220 list. Not that we ought to expect any factors; this is "ecm pretesting", rather than "ecm factoring". Bruce ("Son, Native Oregon-born" ... A carpet-bagger then at UofO was interviewing here, and introduced me to the term: snob. Didn't seem very impressed with PA either.) |
|
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Let's pu{sh to fi}nish base 2- to 1000 bits! | R.D. Silverman | Factoring | 46 | 2014-06-05 16:10 |
| Base-6 speed for prime testing vs. base-2 | jasong | Conjectures 'R Us | 36 | 2010-08-03 06:25 |
| 64 bits versus 32 bits Windows | S485122 | Software | 2 | 2006-10-31 19:14 |
| 35-35.2 to 62 bits, cont from 61 bits | Khemikal796 | Lone Mersenne Hunters | 12 | 2005-12-01 21:35 |
| base 3 | ET_ | Puzzles | 1 | 2003-12-13 10:45 |