Thursday, 26 January 2017

number theory - Prove that one integer among m consecutive integers is divisible by m



Show that of any m consecutive integers, exactly one is divisible by m. I am finding it difficult to prove that there is only one number among m consecutive integers that is divisible by m.



Answer



Let the numbers be br=a+r,0rm1



Existence:



We can apply Pigeonhole Principle to prove the existence by contradiction.



Let none of them is divisible by m, so they can leave m1 distinct remainder(r)s namely, 1rm1



But, as there are m numbers, so at least tow of them leave the same remainders.




Let bu,bv leave the same remainders where $1\le u

Then m divides bvbu=vu



But, $0

Uniqueness:



If m divides both bs,bt,0stm1




m must divide btbs=ts which lies (0,m1] which is impossible



So, there can be at most one r divisible by m


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...