Show there must be two numbers in the list whose difference is $12$.

discrete mathematicspigeonhole-principle

This question came up while tutoring: "$55$ numbers are randomly selected from the first $100$ positive integers. Show there must be two numbers in the list whose difference is $12$."

It definitely requires the Pigeonhole Principle but we were unsure how to set it up. My idea was to list all of the possible pairs whose difference is $12$:

$$(1,13), (2,14), \ldots (87, 99), (88, 100)$$ of which there are $88$ pairs. I'm not sure what to do from here.

I know similar questions have been asked here, like this one. Is there a way to apply those techniques to this problem?

Best Answer

The set of all integers between $1$ and $100$ can be written as $$\lbrace 1,..., 24 \rbrace \cup \lbrace 25, ..., 48 \rbrace \cup \lbrace 49,..., 72\rbrace \cup \lbrace 73, ..., 96 \rbrace \cup \lbrace 97,..., 100 \rbrace $$

If you choose $55$ numbers, then at least $51$ of them are taken in the first four sets. So at least $13$ of them are taken in one of the four sets. Now you can conclude.

Related Question