I feel like this proof should be easy. Prove that for 3 consecutive natural numbers, 1 of the numbers will be divisible by 3. Intuitively this makes sense (add 1, 2 or 3 and then it's divisible by 3, obviously).
Follow Math Help Forum on Facebook and Google+
let if , then if , then if , then So in all three cases, s.t. is divisible by three.
View Tag Cloud