View Single Post
Old 2007-01-10, 09:53   #1
Citrix
 
Citrix's Avatar
 
Jun 2003

1,553 Posts
Default Sierpinski and Riesel number (Fixed k, Variable base)

Has there been any work done to find S/R for fixed k and variable base?

eg. What is the lowest base=b for k=2 such that 2*b^n+1 is never prime?

What k's can never be sierpinski numbers? Is there any proof to this.

How does one generate the sierpinski base for a given k?

(The same questions for Riesel side)
Citrix is offline   Reply With Quote