Skip to main content
MathOverflow

Return to Question

Commonmark migration
Source Link
Community Bot
Community Bot
  • 1
  • 2
  • 3

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.

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.

Source Link
Guest_2015
Guest_2015
  • 577
  • 4
  • 7

Proof for new deterministic primality test possible?

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.