Question

prove that one of every 3 consecutive positive integers are divisible by 3 ( by steps)​

Answer 1

Step-by-step explanation:

LET THE THREE CONSECUTIVE NO.BE n, n+1,and n+2.

a=3q+r (according to euclid's division lemma)at r=0,1,2,

case1,at r=0

n=3q (divisible by 3)

n+1=3q+1 ( both are not

n+2=3q+2 divisible by3)

similarly you can put r=1and2 and you will find that only out of these three consecutive no. only one is divisible by 3