Seveenteen or Bust (SOB)

Let's all welcome a new Hosted Forum. SOB is a prime number variant project.

It's is a distributed attack on the Sierpinski problem. The problem deals with numbers of the form N = k2n + 1, for odd k and n > 1. Numbers in this form are called Proth numbers. If, for a particular value of k, every possible choice of n results in a composite (non-prime) Proth number N, that number k is called a Sierpinski number. The Sierpinski Problem asks "what is the smallest Sierpinski number?".

The client has been recently upgraded to include checkpointing (The last ten minutes). It runs under multiple OSes.

If you are interested, visit the Hosted Forum or grab the client and more info at their Web Site.

The creator of the project is Louis Helm and David Norris. You can ask Louis questions in the forum. His nick is jjjjL.

Colin