Show that one and only one out of n, n+2, or n+4 is divisible by3 where n is any positive integer
Answers
Answered by
8
Here is ur best answer
This procsss is well n correct
Hope it helps u
This procsss is well n correct
Hope it helps u
Attachments:
AthuL15:
thankS ✌
Answered by
3
let n be of the form 3q
we'll take the first case
1) n=3q
here since the remainder is 0,it is divisible by 3
second case
2)n+2=(3q)+2
since here we have a remainder,that is 2 instead of 0,it is not divisible by 3
third case
3)n+4=3q +4
since here we have remainder equal to 4 and not 0 it is also not divisible by 3
Thus out of the 3 cases,that is first one which is 'n' is only divisible by 3
hope this helps u
we'll take the first case
1) n=3q
here since the remainder is 0,it is divisible by 3
second case
2)n+2=(3q)+2
since here we have a remainder,that is 2 instead of 0,it is not divisible by 3
third case
3)n+4=3q +4
since here we have remainder equal to 4 and not 0 it is also not divisible by 3
Thus out of the 3 cases,that is first one which is 'n' is only divisible by 3
hope this helps u
Similar questions