Seventeen or Bust

The Sierpinski Triangle is fascinating and referenced here often. When I found this site I thought I would reference it.

What Is It?

SB (Seventeen or Bust) is a distributed attack on the Sierpinski problem. Our system utilizes the spare computational power of hundreds of computers around the world, creating a powerful network of machines working together on the problem. Anyone can participate: we provide a piece of software that installs on your computer and uses its "spare time" to help our project. You won't even notice it's running, since it only uses your processor if it would otherwise be sitting unused.

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?" (For a more rigorous mathematical discussion of the problem, see prothsearch.net's Sierpinski Problem page.)

John Selfridge proved, 40 years ago, that k = 78,557 is a Sierpinski number. Most number theorists believe that this is the smallest, but it hasn't yet been proven. In order to prove it, we have to show that every single k less than 78,557 is not a Sierpinski number, and to do that, we have to find some n that makes k * 2^n + 1 prime. When Seventeen or Bust was started, this had already been done for all but 17 values of k; hence the name of the project. After 20 months of computation, we have eliminated 7 multipliers: seven down, ten to go.

So who wants to help out?