Conjecture:
Let $n \in \mathbb{N}$ and $n$ odd.
Then the number $N=2^2 + n^2$ is prime, if and only if $N$ divides $2^{(N-1)/2} + 1$.
Thanks.
Conjecture:
Let $n \in \mathbb{N}$ and $n$ odd.
Then the number $N=2^2 + n^2$ is prime, if and only if $N$ divides $2^{(N-1)/2} + 1$.
Thanks.