mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Operation Billion Digits

Reply
 
Thread Tools
Old 2004-04-15, 22:05   #144
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

22×5×19×23 Posts
Default

M3321928483 no factor from 2^62 to 2^64.

Just pushing back the darkness a little...
Uncwilly is online now   Reply With Quote
Old 2004-04-16, 03:28   #145
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

44048 Posts
Default

Where's Ewmayer when we need him? :D
ixfd64 is online now   Reply With Quote
Old 2004-04-19, 01:07   #146
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

22×5×19×23 Posts
Default

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 P-1 it deep (Maybe P-1 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 2004-04-19 at 01:13 Reason: Formatting and an S
Uncwilly is online now   Reply With Quote
Old 2004-04-19, 03:40   #147
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

22×32×5×13 Posts
Default

Quote:
Originally Posted by Uncwilly
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.
I missed the '171. Luigi shows it completed on the Italian language site but didn't announce it here.

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
wblipp is offline   Reply With Quote
Old 2004-04-19, 07:50   #148
HiddenWarrior
 
HiddenWarrior's Avatar
 
Jun 2003
Russia, Novosibirsk

2·107 Posts
Default

Quote:
Originally Posted by Uncwilly
I would like to make a multipronged assualt on M(971).
I saw somewhere in internet the project 'Random-971'. People are searching for factor of M(971) by checking randomly generated factors. Sorry, but the link is lost for now (or the project doesn't work?).
HiddenWarrior is offline   Reply With Quote
Old 2004-04-19, 08:20   #149
nitro
 
Feb 2003

7810 Posts
Default M3321928319

Quote:
Originally Posted by nitro
Neither is there one to 68 bits

M3321928373 no factor from 2^67 to 2^68.
M3321928373 no factor from 2^68 to 2^69.


Now at 69 bits, no factor, switching back to M3321928319
nitro is offline   Reply With Quote
Old 2004-04-19, 08:35   #150
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

22058 Posts
Default

Quote:
Originally Posted by Uncwilly
Are any of us foolish folk up for another challenge? I would like to make a multipronged assualt on M(971).
According to http://www.mersenne.org/ecmm.htm it should still be worth doing more ECM curves at the 50 digit level.

One particularly efficient way to tackle this if a few people are working together is for those with P4s or P4-Celerons 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 gmp-ecm 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.
geoff is offline   Reply With Quote
Old 2004-04-19, 19:37   #151
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

25·149 Posts
Default

Quote:
Originally Posted by wblipp
I missed the '171. Luigi shows it completed on the Italian language site but didn't announce it here.

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'm taking '171 to 70... :-)

Luigi
ET_ is offline   Reply With Quote
Old 2004-04-20, 21:48   #152
nitro
 
Feb 2003

1168 Posts
Default

Quote:
Originally Posted by nitro
M3321928373 no factor from 2^68 to 2^69.


Now at 69 bits, no factor, switching back to M3321928319
M3321928319 no factor from 2^62 to 2^66.
nitro is offline   Reply With Quote
Old 2004-04-23, 01:53   #153
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

25×149 Posts
Default

No more volunteers?

Luigi
ET_ is offline   Reply With Quote
Old 2004-04-23, 01:58   #154
PrimeCruncher
 
PrimeCruncher's Avatar
 
Sep 2003
Borg HQ, Delta Quadrant

2·33·13 Posts
Default

Quote:
Originally Posted by ET_
No more volunteers?

Luigi
I think everyone's a bit more concerned with this at the moment as opposed to such a 'whimsical project'. Speaking of which, there's only one 0.01M range left; I don't suppose someone here would be willing to donate a little computing muscle to finish that up?
PrimeCruncher is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
The "one billion minus 999,994,000" digits prime number a1call Miscellaneous Math 179 2015-11-12 14:59
Ten Billion Digits Mersenne Numbers aketilander Operation Billion Digits 13 2013-02-03 21:15
Operation Megabit Twin Oddball Twin Prime Search 370 2013-01-03 21:26
modulo operation for polynomials? smslca Math 3 2011-04-18 17:18
question range 1 billion to 2 billion? Unregistered Information & Answers 7 2010-08-12 06:25

All times are UTC. The time now is 18:54.

Tue Oct 27 18:54:25 UTC 2020 up 47 days, 16:05, 1 user, load averages: 2.41, 2.28, 2.17

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.