20040415, 22:05  #144 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2×3×1,583 Posts 
M3321928483 no factor from 2^62 to 2^64.
Just pushing back the darkness a little... 
20040416, 03:28  #145 
Bemusing Prompter
"Danny"
Dec 2002
California
2377_{10} Posts 
Where's Ewmayer when we need him? :D

20040419, 01:07  #146 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
9498_{10} Posts 
Isn't Operation Billion Digits (OBD) at level 3? i.e. 3 numbers upto 69 bits?
Looks like: 3321928171 3321928241 3321928307 are all at or above 69. 3321928307 is above 69.7 at the very moment. I hope to be able to report it in @70bits before I am away from the machine for a few days. Are any of us foolish folk up for another challenge? I would like to make a multipronged assualt on M(971). I am thinking of looking at lowM and: having multiple machines working on different levels of Tfactoring (ET_ can your factor3_1 take decimal bits as input?, like 23.45), get someone with a machine with around 4GB to P1 it deep (Maybe P1 Dave), keep a sustained ECM attack (if I understand ECM, one can start at a curve of any number they choose with out having to also run all previous) (we could check out ranges and return them when done), and get a single machine working on a "top down" approach. The "top down" idea is the following: Assume that M(971) is the product of only 2 very large primes (100+ decimal digits). Take an educated guess at the square root of M971, 1.41274212421x10^141 for example. Test the number for primality (if it is too hard, at least check it against the first 1000 primes and insure that it meets the criteria for a factor of a mersenne), if it isn't move up to the next number that passes this test. Divide M971 by the number. Check the result. If the remainder is 0, We Win! If not, note the divisor and quotient and mark them off the list of suspects (even though there is a remainder). Find their mean and start the process again. Continue until the root is found and if it is an interger. If so, WE Win! If that does not find it, have the original machine working on it work the area around the square root. Use presumed primes (it may be worth it put effort into checking them a goodly amount). Have a second machine join in the hunt, but starting in on the range of a cube root. Divide twice and check result, take mean, start over. When that machine finds the cube not to be whole, start it hunting the area for 3 prime factors. Then start a third machine (maybe pull one from the TF work), to start in on the 5th root. My best understanding from the ECM work is that the 7th root might have been taken care of. I know this sounds like a wierd way of doing it, but until the NetSieve folks take up M971, this might be the way for independant machines to best attack it. Last fiddled with by Uncwilly on 20040419 at 01:13 Reason: Formatting and an S 
20040419, 03:40  #147  
"William"
May 2003
New Haven
4471_{8} Posts 
Quote:
Today my '219 passed 69 digits on it's way to 70. That puts us at Level 3.2 (Level 3 (3 at 69 bits) plus two steps towards level 4 (a fourth at 69 and one at 70)). I also took the next four unclaimed numbers to 66 bits. M3321928381 no factor from 2^62 to 2^65. M3321928483 no factor from 2^62 to 2^65. M3321928601 no factor from 2^62 to 2^66. M3321928381 no factor from 2^65 to 2^66. M3321928483 no factor from 2^65 to 2^66. M3321928697 no factor from 2^62 to 2^66. http://ElevenSmooth.com/Billion.html http://www.gimps.it/billion/billion.htm William 

20040419, 07:50  #148  
Jun 2003
Russia, Novosibirsk
11010110_{2} Posts 
Quote:


20040419, 08:20  #149  
Feb 2003
2·3·13 Posts 
M3321928319
Quote:
Now at 69 bits, no factor, switching back to M3321928319 

20040419, 08:35  #150  
Mar 2003
New Zealand
13·89 Posts 
Quote:
One particularly efficient way to tackle this if a few people are working together is for those with P4s or P4Celerons to do the stage one ECM using Prime95/mprime, save the results by putting the GmpEcmHook=1 option in prime.ini, then those with Athlons or P3s to do a deep stage two using gmpecm resuming from the saved file. This would involve emailing the results.txt file from stage one, but it should compress fairly well since each curve has some repeated data. 

20040419, 19:37  #151  
Banned
"Luigi"
Aug 2002
Team Italia
2^{2}·3·401 Posts 
Quote:
Luigi 

20040420, 21:48  #152  
Feb 2003
2×3×13 Posts 
Quote:


20040423, 01:53  #153 
Banned
"Luigi"
Aug 2002
Team Italia
12CC_{16} Posts 
No more volunteers?
Luigi 
20040423, 01:58  #154  
Sep 2003
Borg HQ, Delta Quadrant
2·3^{3}·13 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Ten Billion Digits Mersenne Numbers  aketilander  Operation Billion Digits  14  20210227 07:14 
The "one billion minus 999,994,000" digits prime number  a1call  Miscellaneous Math  179  20151112 14:59 
Operation Megabit Twin  Oddball  Twin Prime Search  370  20130103 21:26 
modulo operation for polynomials?  smslca  Math  3  20110418 17:18 
question range 1 billion to 2 billion?  Unregistered  Information & Answers  7  20100812 06:25 