If n is an integer, show that one of the integers n, n+2, or n+4 is divisible by 3.
If n is a multiple of 3, then there is nothing more to prove.
Suppose n is not a multiple of 3, then n must be of the form
n =3k+1 or n = 3k+2, for some integer k
then n+2 = (3k+1)+2 = 3k+3 = 3(k+1) = multiple of 3
if n = 3k+2,
then n+4 = 3k+6 = 3(k+2) =multiple of 3
hence the result
some other math problems
There is no guarantee about the data/information on this site. You use the data/information at your own risk.You use the advertisements displayed on this page at your own risk.