Pigeonhole: six integers, two differ by a multiple of 5
Need a hint?
How many different remainders are possible when you divide by 5?
Six integers fill only five possible remainders mod 5, so two share a remainder and their difference is divisible by 5.
How to work it out
On division by 5 there are only five possible remainders: 0, 1, 2, 3, 4 (the pigeonholes). Six integers (the pigeons) cannot all go into different holes.
So two integers leave the same remainder, and their difference is a multiple of 5:
(1)
LaTeX source of the formulas on this page
\[ 5\mid a_i-a_j\ \text{for some } i\ne j \]
\[ a_i=5q+r,\ a_j=5q'+r\ \Rightarrow\ a_i-a_j=5(q-q') \]Questions
What is the answer to: Pigeonhole: six integers, two differ by a multiple of 5?
Six integers fill only five possible remainders mod 5, so two share a remainder and their difference is divisible by 5.
What is the key idea?
More objects than boxes means some box holds two (the pigeonhole principle).
Is there a hint?
How many different remainders are possible when you divide by 5?