1

I again stumbled upon an interesting number theory question: $x^2+y^2 = 2019$ with $x, y \in \mathbb{N}$. This one is derived from another Diophantine equation that I am trying to solve. Is there a way to solve this without trying out all the possible cases for $x = 1$ to $31$ ? I mean any sufficiently advanced or unusual technique or quick insight that could be used? Thank you for your time.

DeepSea
  • 77,651
  • 3
    Modular arithmetic? Isn't it 3 mod 4? So there's no solution. – jgon Feb 28 '20 at 06:37
  • 1
    Let me double check the original problem that I solved. It should be $2019$.I got the same answer as you did but that means the original problem I solved has no answer which is not the case. – DeepSea Feb 28 '20 at 06:38

1 Answers1

1

For any $a\in\Bbb{Z}$, if you divide $a^2$ by $4$, then the remainder is either $0$ or $1$. Hence, for any $x,y\in\Bbb{Z}$, if you divide $x^2+y^2$ by $4$, then the remainder must be either $0$, $1$, or $2$. If you divide $2019$ by $4$, then you get a remainder of $3$. It follows that there is no $x,y\in\Bbb{Z}$ with $x^2+y^2=2019$.

user729424
  • 5,061