1

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?

Adam Hughes
  • 36,777
yoyoma207
  • 113

2 Answers2

5

Consider your equation $\pmod 3$

Ross Millikan
  • 374,822
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