- #1
mike1
- 14
- 0
Homework Statement
Prove that it is impossible to find an integer n, such that
n^2 = 2 mod(4) or n^2 = 3 mod(4)
Hence or otherwise, prove that there do not exist integers m and n such that
3m^2 - 1 = n^2
Homework Equations
The Attempt at a Solution
Since n must be congruent to each of 0,1,2,3, n^2 must be congruent to 0,1,4,9 but what do I do next to prove this?