| 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 "Proth prime"
(new) |
(link) |
||
| Line 3: | Line 3: | ||
==See Also== | ==See Also== | ||
*The [[PSearch]] Project | *The [[PSearch]] Project | ||
| + | *[[Proth's theorem]] | ||
==External Links== | ==External Links== | ||
Revision as of 13:47, 4 February 2019
A Proth prime is not a true class of numbers, but primes in the form k*2n+1 with 2n > k are often called Proth primes.
See Also
- The PSearch Project
- Proth's theorem
