[QUOTE]Gary, did you get the email generated by sendspace? [/QUOTE]

Gary's out of town and won't be home till Thursday.

[QUOTE=Puzzle-Peter;345000]Gary, did you get the email generated by sendspace?[/QUOTE]

Yes I got it. I probably won't have time to update the pages until this weekend.

[QUOTE=gd_barnes;345148]Yes I got it. I probably won't have time to update the pages until this weekend.[/QUOTE]

Don't hurry! I just wanted to make sure it didn't end up in the spam folder.

R3 11.0G-12.0G is complete. Data link has been sent to Gary.

Take care

KEP

I wrote some code to help with the initial sieving.
It finds primes for a range of k(start) to k(end) with n=1 to 2000.
base=3
It writes the riesel primes in primes.txt
It writes the candidates left in left3r.txt


It is much faster than PFGW's script and hence useful.
The remaining candidates can then be tested with PFGW.
:smile:

[QUOTE=Citrix;350761]I wrote some code to help with the initial sieving.
It finds primes for a range of k(start) to k(end) with n=1 to 2000.
base=3
It writes the riesel primes in primes.txt
It writes the candidates left in left3r.txt


It is much faster than PFGW's script and hence useful.
The remaining candidates can then be tested with PFGW.
:smile:[/QUOTE]


Ok I will start a test. I start at 20G to 21G now.

Lennart

[QUOTE=Citrix;350761]I wrote some code to help with the initial sieving.
It finds primes for a range of k(start) to k(end) with n=1 to 2000.
base=3
It writes the riesel primes in primes.txt
It writes the candidates left in left3r.txt


It is much faster than PFGW's script and hence useful.
The remaining candidates can then be tested with PFGW.
:smile:[/QUOTE]

Does this program account for MOB's or is every single k tested?

I am assuming you mean K=1 (mod 2)-- yes they are removed.

Note:- The program will overwrite the files if you start the program again. So the files need to be copied to another folder before starting the program again.

[QUOTE=Citrix;350800]I am assuming you mean K=1 (mod 2)-- yes they are removed.

Note:- The program will overwrite the files if you start the program again. So the files need to be copied to another folder before starting the program again.[/QUOTE]

Unfortunantly no, K=1 (mod 2), is only accounting for the general factors. The MOB's is [B]M[/B]ultiple [B]O[/B]f [B]B[/B]ase, hence MOB. A MOB is a k such that K=0 (mod base-value). For these values if k-1 is composit, the testing of the k can be excluded because this k will have the same prime as k/b. If we are using the "starting bases script" and runs PFGW with this script, then if a k meets the previously described conditions, we will in the testing directory, see a file named: pl_mob.txt, while primes will be stored in pl_prime.txt and so forward :)

Regards

KEP

Ps. It may not mean a lot, your program seems to be up to speed, nice work :)

I will put this in the next release and provide more choices for base etc.

Is there any chance of source at some point? If it is faster for riesel base 3 it should be for other large conjecture ks.