Skip to main content
OlympiadHQ

Browse · MathNet

Print

IRL_ABooklet

Ireland counting and probability

Problem

The commuter village of Abelia has a population of individuals. Households vary but the average household size is people. Houses are numbered consecutively. Every inhabitant of Abelia takes a return train trip to a nearby city. There are four trains from Abelia to the city in the morning and four trains from the city to Abelia in the evening. Show that there are two individuals who were on the same train both in the morning and in the evening, and whose house numbers differ by at most .
Solution
There are possible combinations of morning and evening trains. As there must be one combination of morning and evening trains with at least Abelians on both trains. Identify these Abelians, for example by painting them purple.

Suppose for a contradiction that no two purple Abelians live in houses whose numbers differ by or less. Then ordering the Abelians by their house numbers, the first purple Abelian is in house number at least . There can be no purple Abelians in houses or . The second purple Abelian must then be in house number at least , until the th purple Abelian must be in house number at least .

As the average household size is , there are only houses in the village, which is a contradiction.

---

Alternative solution.

Because the average household size is , there are houses in the village. These houses can be grouped into groups such that the house numbers differ by at most in each group, for example, for the six houses form one group, and the remaining two houses form the last group.

Because , there must be at least one group of houses in which at least people live. There are possible combinations of morning and evening trains, hence there are two among these Abelians who were on the same train both in the morning and in the evening.

Techniques

Pigeonhole principle