info prev up next book cdrom email home

Proth's Theorem

For $N=h\cdot 2^n+1$ with Odd $h$ and $2^n>h$, if there exists an Integer $a$ such that

\begin{displaymath}
a^{(N-1)/2}\equiv -1\ \left({{\rm mod\ } {N}}\right),
\end{displaymath}

then $N$ is Prime.




© 1996-9 Eric W. Weisstein
1999-05-26