Hi,
Show that one and only one out of n, n+2 and n+4 is divisible by 3, where ‘n’ is any positive integer.
By the Division Algorithm, n is either of the form 3k, 3k + 1, or 3k + 2.
3k:
,3k+2,3k+4
3k+1: 3k+1,
, 3k+5
3k+2: 3k+2, +3k+4,
In either of the allowed forms, there is only one of n, n+2 and n+4 divisible by three