![]() |
![]() |
#34 |
Aug 2002
3×43×67 Posts |
![]()
Just for fun, I'm burning through this range, split between two boxes... It is going *very* fast...
|
![]() |
![]() |
![]() |
#35 |
"Richard B. Woods"
Aug 2002
Wisconsin USA
170148 Posts |
![]()
Of course it's going very fast -- there are only a very small number of candidate factors below 2^32 for each exponent in that range, almost all of which will be eliminated by the small-prime sieve before any need for division into the Mnumber.
![]() 2^32 = 4,294,967,296. For p = ~250M, 2p = ~500M. The only 2kp+1 candidate factors below 2^32 are for k = 1,2,3,4,5,6,7,8 and it's unlikely that even one of those will survive the small-prime sieve (e.g., at least two of them must be divisible by 3, at least one by 5, and at least one by 7). For p = ~500M, 2p = ~1G. The only candidate factors below 2^32 are for k = 1,2,3,4, and the chance that any of them will actually need to be divided into the Mnumber is quite small. ![]() Let us know how many factors you find, and what percentage that is of the total. |
![]() |
![]() |
![]() |
#36 |
Aug 2002
21C316 Posts |
![]()
One box has done from 250M to 290M and has found 175,190 factors so far...
|
![]() |
![]() |
![]() |
#37 | |
Nov 2003
3·5·11 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#38 |
"Tony Gott"
Aug 2002
Yell, Shetland, UK
2·5·37 Posts |
![]()
Completed and took about 12 days to do on P166.
140199 factors found from 292104 exponents. |
![]() |
![]() |
![]() |
#39 |
Dec 2003
Belgium
5×13 Posts |
![]()
Anyone bothered if i explore this region a little deeper? Say i take the exponents that didn't have a factor up to 50 bits depth and search to 55 orso...
-michael |
![]() |
![]() |
![]() |
#40 | |
"Tony Gott"
Aug 2002
Yell, Shetland, UK
5628 Posts |
![]() Quote:
I'm interested as would like to do the same on the range I worked through.... |
|
![]() |
![]() |
![]() |
#41 |
Dec 2003
Belgium
5·13 Posts |
![]()
I just use the grep utility Xyzzy talked about in the other thread. Then i edited the text a bit and made the lines in worktodo.ini look like
AdvancedFactor=exponent,exponent,50,56 When i tried Factor=exponent it wouldn't work, perhaps cause the exponent is too big for that command, i wouldn't know. I already did 185 to 186M and found 2450 new factors (50-56bit depth) -michael |
![]() |
![]() |
![]() |
#42 |
Feb 2003
163 Posts |
![]()
If you just want to remove exponents, ie. to find a first factor, then that's ok. But if you would like to find more (new) factors then it's better to check all (prime) exponents in the higher bit range or even better : start at 33 bit !
In the latter case you will find lots of already known factors (from the first run 28-50) but also a lot of new factors for exponents where the first factor found was pretty small, ie. <=32 bit. |
![]() |
![]() |
![]() |
#43 |
May 2003
12616 Posts |
![]()
I was about to build a new computer, so I can take this range.
ThomRuley |
![]() |
![]() |
![]() |
#44 |
May 2003
2×3×72 Posts |
![]()
Here's an update. I just finished building this computer, and I have already assigned the range 240-250M to my old machine.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
New ranges at OBD | ET_ | Operation Billion Digits | 4 | 2010-07-13 11:34 |
All Available Ranges | hbock | Lone Mersenne Hunters | 0 | 2003-10-27 22:54 |
Available Ranges below 60 bit | hbock | Lone Mersenne Hunters | 13 | 2003-10-24 23:40 |
Ranges for P4s | geoff | Lone Mersenne Hunters | 1 | 2003-09-05 18:13 |
List of LoneMersenneHunter ranges currently out. | garo | Lone Mersenne Hunters | 0 | 2003-05-13 21:17 |