Riesel Sieve |
Introduction
Riesel's Theorem hypothesizes that there exist infinitely many odd integers k such that k*2n - 1 is composite for every n > 1. Riesel showed that k = 509203 has this property, and also the multipliers kr = k0 + 11184810r for r = 1, 2, 3, . . . Such numbers are now called Riesel numbers because of their similarity with the Sierpinski numbers. The "Riesel problem" consists in determining the smallest Riesel number. The Riesel Sieve project uses volunteered computing resources to remove prime candidates from the roughly 11 million possibilities, thus gradually closing in on potential solutions.
Contents | |
Videos
Science
[The Science section might (or might not) be divided into two parts: {1} general discussion of the field, and then {2} a discussion of the project's specific endeavor. For instance, in LHC@home, we might have {1} "Science of the Large Hardon Collider" and then {2} "Science of LHC@home"
The above is desirable, because in most cases, the field of research is really fascinating, and presenting this in broad terms-- outlining the big questions-- can make it easier to understand the particulars of the project and why it is important. ]
Results
[Where known, we should attempt to keep track of each project's publications. A good list to draw from is here. ]
Links of Interest
[Why recreate the wheel; there are lots of great sources out there.; a good list of sources can be really useful to the reader.]
Riesel Sieve in the Classroom
[For each project, please add a "[Projectname] in the Classroom" section-- with a link to Volunteer Computing In the Classroom and an article named "[Projectname] in the Classroom". (Then please add "[Projectname] in the Classroom" to the list on the main Education page.)]
Categories: Projects