| 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"
(own page instead redir) (Tag: Removed redirect) |
(Fill in some of the sections) |
||
| Line 1: | Line 1: | ||
==Purpose== | ==Purpose== | ||
| + | To solve the [[Sierpiński problem]] by finding a prime of the form {{Kbn|+|k|n}} for each remaining value of {{Vk}} < 78,557. | ||
==Status== | ==Status== | ||
| Line 18: | Line 19: | ||
==History== | ==History== | ||
| + | *2016-10-31: [[Proth prime 10223|{{Kbn|+|10223|31172165}}]], eliminating {{Vk}} = 10223 from the search | ||
==See also== | ==See also== | ||
| + | *[[PrimeGrid]] | ||
| + | *[[Seventeen or Bust]] | ||
| + | *[[Sierpiński problem]] | ||
==External links== | ==External links== | ||
[[Category:PrimeGrid Seventeen or Bust| ]] | [[Category:PrimeGrid Seventeen or Bust| ]] | ||
Revision as of 07:46, 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
