Maths Olympiad Prep

Library / /123 of 196

Combinatorics Difficulty 5.4 AIME, harder Prove it Soviet Union

Problem:

There are 21 towns. Each airline runs direct flights between every pair of towns in a group of five. What is the minimum number of airlines needed to ensure that at least one airline runs direct flights between every pair of towns?

Solution

Solution:

Answer: 21.

There are 210 pairs of towns. Each airline serves 10 pairs, so we certainly need at least 21 airlines. The following arrangement shows that 21 is possible:

12345
16789
110111213
114151617
118192021
26101418
27111519
28121620
29131721
36111621
37101720
38131419
39121518
46121719
47131618
48101521
49111420
56131520
57121421
58111718
59101619

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.