| Seventeen Or Bust |
Article Index for Seventeen |
Website Links For Seventeen |
Information AboutSeventeen Or Bust |
| CATEGORIES ABOUT SEVENTEEN OR BUST | |
| distributed computing projects | |
| analytic number theory | |
|
The goal of the project is to prove that 78,557 is the smallest Sierpinski Number . To do so, all odd numbers less than 78,557 must be eliminated as possible Sierpinski numbers. If a number ''k2n + 1'' is found to be Prime , then ''k'' is proven not to be a Sierpinski number. Before the project began, all but seventeen numbers below 78,557 had been eliminated. If the goal is reached, the conjecture of the Sierpinski Problem will be proven true. So far prime numbers have been found in nine of the sequences, leaving eight for testing. There is also the possibility that some of the remaining sequences contain no prime numbers; if that possibility weren't present, the problem would not be interesting. If there is such a sequence, the project would go on for eternity, searching for prime numbers where none can be found. However, since no mathematician trying to prove that one of the remaining sequences contains only Composite Number s has ever been successful, the conjecture is generally believed to be true. The prime numbers found so far by the project are: Note that each of the these numbers has enough digits to fill up a middle-sized Novel , at least. The project is presently dividing numbers among its active users, in hope of finding a prime number in the following sequences: :10223×2n +1 :19249×2n +1 :21181×2n +1 :22699×2n +1 :24737×2n +1 :33661×2n +1 :55459×2n +1 :67607×2n +1 SEE ALSO EXTERNAL LINKS |
|
|