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

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

then $N$ is Prime.