"Prove that if n is a perfect square, $\,n+2\,$ is NOT a perfect square." I'm having trouble picking a method to prove this. Would contraposition be a good option (or even work for that matter)? If not, how about contradiction?
[Math] Proof: If n is a perfect square, $\,n+2\,$ is NOT a perfect square
discrete mathematics
Related Question
- [Math] Prove that if n is a perfect square, then n+2 is not a perfect square
- [Math] Prove by contraposition help.
- [Math] Prove: If n is a perfect square, then n+3 is not a perfect square
- When is $ 999\cdots$ a perfect square
- Prove that for any integer $n>0$ which is a perfect square, $n+4$ is not a perfect square.
Best Answer
Hint: Every perfect square is either $0$ or $1$ modulo $4$.