Seventeen gold Bust

“ Seventeen gold Bust ” (Seventeen or stop) is a project of Calcul distributed, to solve the problem of Sierpinski.

The goal of this project is to prove that 78.557 is smallest Nombre of Sierpinski. With this intention, all the odd numbers lower than 78.557 must be eliminated from the list of the possible numbers of Sierpinski. If a number

k2^ {N} + 1 \, \!

is found as being first, then K is proven like not being a number of Sierpinski. Before the project does not start, all the numbers lower than 78.557 except seventeen had been eliminated.

If the goal is reached, the conjecture of the problem of Sierpinski will be shown. For the moment, the prime numbers were found in eleven continuations, leaving six test.

There exists as the possibility as certain remaining continuations do not contain any prime number; if this possibility were not present, the problem would not be interesting. If there exists such a continuation, the project would turn for eternity, seeking prime numbers where none can be found. However, since no mathematician trying to show that the remaining continuations containing only made up numbers succeeded forever, the conjecture is generally recognized like true.

The project is currently dividing the numbers among its active users, with the hope to find a prime number in the remaining continuations. The prime numbers found by the project are:

External bonds

Site of Seventeen gold Bust
Wiki de Seventeen gold Bust

Random links: