![]() |
NeRDs_471240 reservations
Please use this thread to make your reservations for NeRDs_471240 or email [EMAIL="paulunderwood@mindless.com"]paulunderwood@mindless.com[/EMAIL]
[URL="http://mersenneforum.org/nerds/"]File number[/URL]: 001-179 Serge Batalov 180 Paul Underwood (done) 181 Paul Underwood (done) 182 Paul Underwood (done) 183 Paul Underwood (done) 184 VBCurtis 185 VBCurtis 186 VBCurtis 187 VBCurtis |
Taking the CHG-KP candidates 001-020 :smile:
|
I'll take 184-187 for my Ubuntu box.
|
Taking 021-040.
|
Taking 041-060, [COLOR="Blue"]... plus 061-062.
Now, starting from file 063, [B]all you need is [STRIKE]love[/STRIKE] LLR[/B]. (Because 10^a-10^b-1 is proven by LLR when b>a/2.) Very low threshold to enter the race![/COLOR] |
Taking 063-099
|
No primes yet, Serge?
180 181 182 183 for me :smile: |
1 Attachment(s)
It's one tough mother! I am running out of work ^_^
Taking 100-120. ________________________ [COLOR="Blue"]Done with 1-120 (attached).[/COLOR] |
Taking 121-140.
|
Taking 141-170.
|
I'm going to go ahead and give up 184-187. They're going to take way too long on my older box, and I don't want to hold things up.
|
1 Attachment(s)
And just to save a little time, here's the completed numbers from 184-187. Only a couple dozen, but no need to redo them. None were primes.
|
Thanks :tu:
|
You bet! Sorry I don't have a faster way to process these. I was hoping the Phenom II X4 would be sufficiently fast, but it was taking ~6 hours for each number.
|
Yeah they are taking 1:20 hours on my i7. Generic modular reduction is really slow compared to special. :smile:
|
Taking 171-179.
|
I'll take the last four, 184-187.
|
Note those files have been partially done. See wombatman's post with its attachment.
|
Thanks, I've deleted his completed results from the input files. Just a single i7 core presently for them, so about 2 weeks per file.
|
1 Attachment(s)
Done with my reservations. Also included are my own lightly sieved files "-010... -001" (PRP-candidates; some of them could still be provable: this depends on smoothness of n-m and occasional deeper than average factorizations of 10^(n-m)-1).
|
Thanks a million, Serge. This exponent has been extremely disappointing, considering 15% or so was left after sieving. Let's hope either VBCurtis or I get a consolation prize :smile:
|
That would be great! -- I've used up all my luck on previous expo :rolleyes: so, what's fair is fair!
|
1 Attachment(s)
No consolation prize for me. 184 to 187 complete, no primes. Most results attached; a few dozen tests were done on another machine and are not included.
-Curtis |
All times are UTC. The time now is 14:54. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.