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 

RELATED QUESTIONS

Show that one and only one out of n, n+2 and n+4 is divisible by 3, where ‘n’ is any... (answered by richard1234)

Show that one and only one out of n, n+2, n+4 is divisible by 3, where n is any positive... (answered by ewatrrr)

Prove that one and only one out of n,n+4,n+8,n+12 and n+16 is divisible by 5,where n is... (answered by math_helper)

show that only one out of n, n+2 or n+4  is divisible by 3 where n is positive... (answered by Edwin McCravy)

Show that only one of the numbers n, n+2, n+4 is divisible by... (answered by solver91311)

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

Prove that {{{ 2^n + 5^n }}} is divisible by 7, where n is any odd, positive... (answered by Alan3354)

Show that one out of n,n+3,n+6,n+9 is divisible by n when n is a natural number?


 (answered by solver91311)

show that n^2 -1 is divisible by 8, if n is an odd positive... (answered by mathmate)