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

From Prime-Wiki
Revision as of 18:15, 28 September 2023 by Happy5214 (talk | contribs) (Changing notation to modern form and correcting converse)
Jump to: navigation, search

This article is about Proth's theorem.

Proth's theorem (1878) states:

Let [math]\displaystyle{ p = k*2^n+1 }[/math] and [math]\displaystyle{ k \lt 2^n }[/math]; then [math]\displaystyle{ p }[/math] is prime if there is an integer [math]\displaystyle{ a }[/math] such that

[math]\displaystyle{ a^{(p-1)/2} \equiv -1\pmod{p} }[/math].

Furthermore, if [math]\displaystyle{ a }[/math] is a quadratic non-residue modulo [math]\displaystyle{ p }[/math], then the converse is also true.

A prime [math]\displaystyle{ p }[/math] of this form is known as a Proth prime.

External links