1 thought on “show that one and only one out of n, (n+1), (n+2) is divisible by 3 , where being any positive integer”
Answer:
On dividing n by 3, let q be the quotient and r be the remainder . Case I If n = 3q then n is clearly divisible by 3. Case II If n= ( 3q +1) then ( n+2) = (3q +3) = 3(q +1) , which is clearly divisible by 3. … Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m , 9m+1 or 9m+8
Answer:
On dividing n by 3, let q be the quotient and r be the remainder . Case I If n = 3q then n is clearly divisible by 3. Case II If n= ( 3q +1) then ( n+2) = (3q +3) = 3(q +1) , which is clearly divisible by 3. … Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m , 9m+1 or 9m+8