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,0≤r≤m−1
Existence:
We can apply Pigeonhole Principle to prove the existence by contradiction.
Let none of them is divisible by m, so they can leave m−1 distinct remainder(r)s namely, 1≤r≤m−1
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 bv−bu=v−u
But, $0
Uniqueness:
If m divides both bs,bt,0≤s≤t≤m−1
m must divide bt−bs=t−s which lies ∈(0,m−1] which is impossible
So, there can be at most one r divisible by m
No comments:
Post a Comment