| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "PrimeGrid Seventeen or Bust"
(→External links: +forum introduction thread) |
(→See also: +multi) |
||
| Line 22: | Line 22: | ||
==See also== | ==See also== | ||
| + | *[[Multi Reservation:16|Multi Reservation for project]] | ||
*[[PrimeGrid]] | *[[PrimeGrid]] | ||
*[[Seventeen or Bust]] | *[[Seventeen or Bust]] | ||
Revision as of 07:48, 3 October 2020
Contents
Purpose
To solve the Sierpiński problem by finding a prime of the form k•2n+1 for each remaining value of k < 78,557.
Status
There are 5 sequences:
History
- 2016-10-31: 10223•231172165+1, eliminating k = 10223 from the search
