Introduction to Mathematical Thinking-Problem 5

5.Prove that for any integer $n$, at least one of the integers $n,n+2,n+4$ is divisible by 3.

Proof: By the Division Theorem, $n$ can be expressed as either $3q$, or $3q+1$, or $3q+2$, where $q$ is an integer.
If $n=3q$, we have $n$ divisible by 3.
If $n=3q+2$, we have $n+4=3q+6$ divisible by 3.
If $n=3q+4$, we have $n+2=3q+6$ divisible by 3.
Therefore, for any integer $n$, at least one of the integers $n,n+2,n+4$ is divisible by 3.