View Single Post
Old 2008-09-16, 08:01   #4
MrOzzy
 
MrOzzy's Avatar
 
Apr 2008
Antwerp, Belgium

3·19 Posts
Default

Quote:
Originally Posted by Siemelink View Post
1) Check out http://gbarnes017.googlepages.com/Ri...onjectures.htm
2a) Run a black box program that calculates it for you. In the Crus forum there is the program by R. Gerbicz. Or you can ask me for a copy of mine.
2b) Or sieve a range of your base in srsieve and then the one that is discarded may be a Riesel or Sierpinski
2c) Or figure out how to find them yourself (not easy)
3a) First do a run with PFGW to dispose of all the small primes (see attached script)
3b) Then sieve the remaining k with srsieve
4) when you have sieved deep enough, switch to LLR or phrot.

Enjoy, Willem.
Thanks for your answers. I have a few more questions though:

2a) This program by R. Gerbicz (covering.exe) requires an exponent. What is the meaning of this exponent?
3a) How is PFGW related to that attached script?
3b) How do you know if you have sieved deep enough
4) How should you determine if you should use LLR or phort?

One of the reasons I ask this questions is to lower the step for people interested. Sooner or later a sticky topic with the needed info could be handy and interesting for potential sievers or prime hunters.

Last fiddled with by MrOzzy on 2008-09-16 at 08:06
MrOzzy is offline   Reply With Quote