Maths Olympiad Prep

Library / /41 of 74

, 2016

Combinatorics Difficulty 5.6 AIME, harder Find the answer Slovenia

Three friends, Andrej, Blaž and Cene, were playing badminton. For each game, two of them were playing one against the other, and the third was free. After each game, the winner of the game played against the one that was free in the last game. Andrej played 1717 games and Blaž played 2323 games. At least how many games did Cene play?

Pick one

Solution

Let nn be the number of games played by Cene. Then the total number of games was 17+23+n2\frac{17+23+n}{2}, which implies that nn is even. The total number of games was at least 2323 since Blaž has played this many of them. Since Cene was free for at most one game in a row he had to have played at least 1111 games, but nn is even which means he played at least 1212 games. So the total number of games was at least 17+23+122=26\frac{17+23+12}{2} = 26, which in turn implies that Cene has played at least 1313 games, or, due to parity, at least 1414. In this case Andrej and Blaž have played 17+23142=13\frac{17+23-14}{2} = 13 times, Andrej and Cene 17+14232=4\frac{17+14-23}{2} = 4 times and Blaž and Cene 23+14172=10\frac{23+14-17}{2} = 10 times. To show that this is indeed possible consider the following example: C-A, A-B, B-C, B-A, A-C, A-B, B-C, B-A, A-C, A-B, B-C, B-A, A-C, A-B, B-C, B-A, B-C, B-A, B-C, B-A, B-C, B-A, B-C, B-A, B-C, B-A, B-C, B-A, B-C. The correct answer is (D).

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.