I'm been struggling with this proof for a couple of hours. I originally thought I could prove it by contradiction and let some $n^2=3k^2+2 $to prove there is a contradiction, but it got me nowhere. Any hints?
Asked
Active
Viewed 160 times
1
-
As a follow up to @RossMillikan's very good hint: consider what you get from $(3k)^2\pmod 3$, $(3k+1)^2\pmod 3$ and $(3k+2)^2\pmod 3$. – Cameron Williams Feb 16 '15 at 04:39
-
Extremely similar question. – Najib Idrissi Feb 16 '15 at 14:46
2 Answers
3
If exist $n$ integer such as $3k^2=n^2-2$
then $3|(n^2-2)$
that is $n^2\equiv2$ (mod 3).
But the last congruence has no solutions because the only squares (mod 3) are 1 and 0.
Kamala
- 170