Diophantine Equationsmedium
0:00.0

By Fermat's Two-Square Theorem, a positive integer nn can be represented as x2+y2x^2 + y^2 if and only if in its prime factorization, every prime p3(mod4)p \equiv 3 \pmod{4} appears to an even power. Which number CANNOT be represented as x2+y2x^2 + y^2 for integers x,yx, y?