| 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"
(sorting) |
(link table) |
||
| Line 4: | Line 4: | ||
*The [[PSearch]] Project | *The [[PSearch]] Project | ||
*[[Proth's theorem]] | *[[Proth's theorem]] | ||
| + | *[[Proth prime table|Table]] with all availabe bases | ||
==External Links== | ==External Links== | ||
Revision as of 12:58, 29 April 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
- Table with all availabe bases
External Links
Number classes
| General numbers |
| Special numbers |
|
| Prime numbers |
|
