Description: Proth's theorem (1878). If P is aProth number, i.e. a number of the form k2^n+1 with k less than 2^n, and if there exists an integer x for which x^((P-1)/2) is -1 modulo P, then P is prime. Such a prime is called aProth prime. Like Pocklington's theorem (see pockthg ), Proth's theorem allows for a convenient method for verifying large primes. (Contributed by AV, 5-Jul-2020)
Ref | Expression | ||
---|---|---|---|
Hypotheses | proththd.n | |
|
proththd.k | |
||
proththd.p | |
||
proththd.l | |
||
proththd.x | |
||
Assertion | proththd | |