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"
(navbox) |
(definition) |
||
(3 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | A '''Proth prime''' is not a true class of numbers, but primes in the form k | + | A '''Proth prime''' is not a true class of numbers, but primes in the form {{Kbn|+|k|n}} with 2<sup>''n''</sup> > ''k'' are often called Proth primes. |
+ | |||
+ | Different from this definition all values ''n'' ≥ 1 are listed in {{SITENAME}}. | ||
==See Also== | ==See Also== | ||
*The [[PSearch]] Project | *The [[PSearch]] Project | ||
*[[Proth's theorem]] | *[[Proth's theorem]] | ||
+ | *[[Proth prime table|Table]] with all available ''k''-values | ||
==External Links== | ==External Links== | ||
Line 10: | Line 13: | ||
*[[Wikipedia:Proth number|Wikipedia]] | *[[Wikipedia:Proth number|Wikipedia]] | ||
{{Navbox NumberClasses}} | {{Navbox NumberClasses}} | ||
− | [[Category:Proth prime]] | + | [[Category:Proth prime| ]] |
Revision as of 07:27, 15 May 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.
Different from this definition all values n ≥ 1 are listed in Prime-Wiki.
See Also
- The PSearch Project
- Proth's theorem
- Table with all available k-values
External Links
Number classes
General numbers |
Special numbers |
|
Prime numbers |
|