[QUOTE=gd_barnes;218872]I'm sorry about your systems.

Yes, can you please post the sieve file or Email it to me at:
gbarnes017 at gmail dot com

Thanks.[/QUOTE]

Of course, here is the file. But the backup was before I removed the prime which was already found. So there are 75 k-values.

S43
 

Sierp 43 tested n=100K-200K. 1 prime previously reported - 1 Left

Results emailed - Base released

Due to a stupid cut-and-paste error, I have accidentally wiped 27 primes from Riesel base 51 from my system. They were all at n=501. The k's don't appear in the files of remaining ks because I removed them in order to sieve further ranges, so I can't quickly resieve n=501 and find the primes. Is there a quicker way to identify the missing ks do this than to test n=501 for all >3M ks not eliminated from the conjecture? Basically, I need to create a file with all the ks in it, then remove the ones with primes, trivial factors etc. Then I can compare it with the file of remaining ks and the differences will be the ks with the 27 missing primes. I'm a total noob when it comes to programming.
I'll continue testing anyway.

[quote=10metreh;219404]Due to a stupid cut-and-paste error, I have accidentally wiped 27 primes from Riesel base 51 from my system. They were all at n=501. The k's don't appear in the files of remaining ks because I removed them in order to sieve further ranges, so I can't quickly resieve n=501 and find the primes. Is there a quicker way to identify the missing ks do this than to test n=501 for all >3M ks not eliminated from the conjecture? Basically, I need to create a file with all the ks in it, then remove the ones with primes, trivial factors etc. Then I can compare it with the file of remaining ks and the differences will be the ks with the 27 missing primes. I'm a total noob when it comes to programming.
I'll continue testing anyway.[/quote]
Do you have a list of all the sequences remaining before then? If so you could sieve just n=501 using srsieve. It would also be quite easy to find all the primes at n=501 for all ks(including those with primes found below n=501) using pfgw.

[QUOTE=henryzz;219414]Do you have a list of all the sequences remaining before then?[/quote]

No. Also, testing just 1 n with so many ks (72360 were remaining at n=500) results in the bizarre problem of srsieve spending its time spewing out thousands of "removed candidate sequence xxxxxxx*51^n-1 from the sieve" errors.

[quote]It would also be quite easy to find all the primes at n=501 for all ks(including those with primes found below n=501) using pfgw.[/QUOTE]

But it would be easier if I could remove the primed ks. Then I would have about 3.3 million less tests to do! I have a feeling inside me that there probably is a way to produce a list of all the ks and then remove the ones with primes below n=500 (I have the primes with n up to 500 separate from the larger ones) to produce a list of the ks that remained at n=500. But I now can't do any more tests due to the complete wiping of the pl_remain.txt file by Mini-Geek's remove_ks.pl script which I am about to detail in "the scripts thread".

[quote=10metreh;219417]No. Also, testing just 1 n with so many ks (72360 were remaining at n=500) results in the bizarre problem of srsieve spending its time spewing out thousands of "removed candidate sequence xxxxxxx*51^n-1 from the sieve" errors.[/quote]


I'm assuming that you don't need the primes for removing k's from the sieve file. Is that correct? If so, I think the best idea is:

Set the starting bases script to a minimum n of 501 and a maximum n of 501. Don't worry about sieving...too difficult. The starting bases script will appropriately remove k's with trivial factors, etc. You will wind up with a ton of extra primes but that is OK.

When you post the file of primes for us, just include n=501 as a separate file with a note that you accidently lost the n=501 primes. I/we will remove the k's from n=501 that already had primes for n<=500.

In reading all of the related issues to this, this is quite a thorny problem. How much CPU time would it take to rerun the starting bases script from scratch through n=501? If that can be done in 2-3 CPU days, I would be more comfortable with it. Then we would know we have it correct.

Edit: I just ran a small range of the starting bases script. By my estimate, you should be able to rerun the entire range for n=1 to 501 in ~1 CPU day. For such a low n, using trial factoring of 30%, i.e. with the -f30 switch, is close to the fastest way. 10% might even be faster but I prefer at least 30% to avoid extra composite PRPs. [Note for efficiency: It's always faster to do at least some trial factoring.]

That is now my new suggestion: Rerun the starting bases script for n<=501. If you need help sorting out only the n=501 primes, I'm sure someone could extract those out for you. Or if you Email me the n<=501 primes file, I'll be glad to do so.

This is far easier and more accurate than anything we could do programmatically since you not only lost the n=501 primes, you also lost your k's remaining at n=500.

In March I've tested R51 for n=1-9 with my script.
I've removed all k==6 mod 10 and all odd k-values.
Here's the log file of that:
[code]
2010/03/19 02:30:55 n=1 : 730209 primes, 3586057 remain
2010/03/19 02:49:18 n=2 : 97179 primes, 385674 PRPs, 3103204 remain
2010/03/19 03:05:08 n=3 : 1294 primes, 333491 PRPs, 2768419 remain
2010/03/19 03:18:58 n=4 : 13 primes, 239725 PRPs, 2528681 remain
2010/03/19 03:31:25 n=5 : 186001 PRPs, 2342680 remain
2010/03/19 03:43:36 k==6 mod 10: 863253 found, 2722804 remain
2010/03/19 03:58:28 n=2 : 97179 primes, 484163 PRPs, 2239951 remain
2010/03/19 04:11:14 n=3 : 1294 primes, 333491 PRPs, 1905166 remain
2010/03/19 04:21:42 n=4 : 13 primes, 239725 PRPs, 1665428 remain
2010/03/19 04:30:53 n=5 : 186001 PRPs, 1479427 remain
2010/03/19 04:39:02 n=6 : 150595 PRPs, 1328832 remain
2010/03/19 04:46:12 n=7 : 114401 PRPs, 1214431 remain
2010/03/19 04:53:00 n=8 : 99298 PRPs, 1115133 remain
2010/03/19 04:59:17 n=9 : 83118 PRPs, 1032015 remain
[/code]

No MOB's removed!
I'm just testing the remaining 1032015 pairs for n=501 prime.
Ready in about an hour.

Karsten,

For accuracy concerns, I would just as soon that he rerun the entire starting bases script for n=1 to 501. As suggested in my last edited post, that should only take him ~1 CPU day.

This is because not only is he missing the n=501 primes, he is also missing the k's remaining file at n=500. I'd like to see that file of k's remaining at n=501 when he sends me his final status. I can then take that and remove k's with primes for n>501 to get a definitive list of k's remaining at his final status point.


Gary

S55 complete to n=105K, extending reservation to n=150K.

No additional primes, 4 k's remaining.

Results up to n=100K are attached.

Sorry, but I couldn't get onto the internet in time to see the post. As a result, kar_bon re-computed the base to n=500 and PMed me before I read the suggestion.