| 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 |
Proth's theorem
Revision as of 13:26, 4 February 2019 by Karbon (talk | contribs) (Karbon moved page Proth's Theorem to Proth's theorem without leaving a redirect: name)
This article is about Proth's theorem.
The Proth's theorem (1878) states:
Let [math]\displaystyle{ n = h*2^k+1 }[/math] and [math]\displaystyle{ h\lt 2^k }[/math]; then [math]\displaystyle{ n }[/math] is prime if (and only if) there is an integer [math]\displaystyle{ a }[/math] such that
- [math]\displaystyle{ a^{(n-1)/2} \equiv -1 (mod\,n) }[/math].
A prime of this form is known as Proth prime.
