| Seventeen or Bust |
 |
 |
 |
| Active Projects - Math & Strategy Games |
Volunteer Computing is used in Seventeen or Bust in an attempt to solve the Sierpinski Problem. From the Seventeen or Bust site: The Sierpinski problem itself deals with numbers of the form N = k * 2^n + 1, for any odd k and n ≥ 1. Numbers of this form are called Proth numbers. If, for some specific value of k, every possible choice of n results in a composite (non-prime) Proth number N, then that k is called a Sierpinski number. The Sierpinski problem itself is: "What is the smallest Sierpinski number?"
|