Math, asked by RS1316, 9 months ago

show that one only one of n,n+2,n+4 is divisible by 3​

Answers

Answered by hozaifa27
11

Let n be any integer. let it divide by 3

by using Euclid's division lemma :

n = 3q + r

0_< r<3

r=0,1,2

n=3q or 3q+1or 3q+2

Case1-:

let n=3q

here n = 3q is divisible by 3

n+2=3q+2 is not divisible by 3

n+4= 3q+4 = 3q+3+1= 3(q+1)+1 is not divisible by 3.

Case 2-:

let n = 3q+ 1

here n = 3q+ 1 is not divisible by 3

n+2 = 3q+1+3= 3q+3 = 3(q+1) is divisible by 3

n+4= 3q+1+4= 3q +5= 3(q+1)+2 is not divisible by 3

Case 3-:

let n =3q+2

here n= 3q+2 is not divisible by 3

n+2 =3q+2+2= 3q+4= 3(q+1)+1 is not divisible by 3

n+4= 3q+2+4 =3q+6= 3(q+2) is divisible by 2

Hence, it is clear that one and only one out of n,n+2,n+4 is divisible by 3


hozaifa27: tumne kya ek doll ki dp lagayi h
RS1316: any profile
RS1316: ha
RS1316: ku koi problem
hozaifa27: sorry
RS1316: ku
RS1316: tumhari profile kya h
RS1316: maine re quest aacept kr li
RS1316: byyyyy
RS1316: are u use fb loras
Answered by LorasV370
3

Answer:

Here's the answer.

Step-by-step explanation:

Hope it helps.

Please mark it as Brainliest.

Attachments:

RS1316: hii loras
Similar questions