Is there a prime $m^2+n^2$ for all $m\in\mathbb N$ given $m \geq n$?
The number of solutions is given by OEIS/A069004. There it says that it is an open problem whether there are always solutions.
Is there a prime $m^2+n^2$ for all $m\in\mathbb N$ given $m \geq n$?
The number of solutions is given by OEIS/A069004. There it says that it is an open problem whether there are always solutions.