Exercise 1.2.11 ($4$ doesn't divide $n^2 + 2$)

Prove that 4 n 2 + 2 for any integer n .

Answers

Proof. Assume that 4 ( n 2 + 2 ) .

  • If n is even, n = 2 k for some integer k . Then 4 4 k 2 + 2 , thus 4 2 . Since 4 2 , this is a contradiction.
  • If n is odd, n = 2 k + 1 for some integer k . Then 4 ( 2 k + 1 ) 2 + 2 = 4 k 2 + 4 k + 3 , thus 4 3 . This is a contradiction.

Therefore the hypothesis 4 ( n 2 + 2 ) leads to a contradiction in both cases. We can conclude that 4 ( n 2 + 2 ) for any integer n . □

User profile picture
2024-06-16 15:17
Comments