SOLUTION: Prove that one of every three consecutive positive numbers is divisible by 3

Question 1039608: Prove that one of every three consecutive positive numbers is divisible by 3

Answer by addingup(3677) (Show Source): You can put this solution on YOUR website!
Let 3 consecutive positive integers be n, n+1 and n+2
Whenever a number is divided by 3, the remainder we get is either 0, or 1, or 2.
:
Therefore:
n = 3p or 3p+1 or 3p+2, where p is some integer
If n = 3p, then n is divisible by 3
If n = 3p+1, then n+2 = 3p+1+2 = 3p+3 = 3(p+1) is divisible by 3
If n = 3p+2, then n+1 = 3p+2+1 = 3p+3 = 3(p+1) is divisible by 3
Thus, we can state that one of the numbers among n, n+1 and n+2 is always divisible by 3
RELATED QUESTIONS
Prove that the product of three consecutive positive integers is divisible by... (answered by CubeyThePenguin)

Prove that the product of three consecutive integers is divisible by 6; of four... (answered by Edwin McCravy)

Prove the following conjecture: "The sum of any three positive consecutive integers will (answered by scott8148)

Prove the following conjecture: "The sum of any three positive consecutive odd integers... (answered by Alan3354)

"Show that the product of three consecutive natural numbers is divisible by... (answered by richard1234)

Prove by induction and through divisibility algorithm that 11^n - 6 is divisible by 5... (answered by ikleyn)

I am thinking of a positive number, less than 500, that is divisible by every number from (answered by ankor@dixie-net.com)

Prove that {{{ n^3 + 5n }}} is divisible by 6, where n is any positive... (answered by ikleyn)

prove that the product of any three consecutive numbers is even. So far I have tried , (answered by josgarithmetic,tenkun,amalm06,ikleyn)