Maths Olympiad Prep

Library / /56 of 71

Combinatorics Difficulty 5.4 AIME, harder Prove it United States

Problem:
Knot is ready to face Gammadorf in a card game. In this game, there is a deck with twenty cards numbered from 11 to 2020. Each player starts with a five card hand drawn from this deck. In each round, Gammadorf plays a card in his hand, then Knot plays a card in his hand. Whoever played a card with greater value gets a point. At the end of five rounds, the player with the most points wins. If Gammadorf starts with a hand of 1,5,10,15,201,5,10,15,20, how many five-card hands of the fifteen remaining cards can Knot draw which always let Knot win (assuming he plays optimally)?

Solution

Solution:
Answer: 29822982

Knot can only lose if all of his cards are lower than 1010; if not he can win by playing the lowest card that beats Gammadorf's card, or if this is not possible, his lowest card, each turn. There are (75)=21\binom{7}{5} = 21 losing hands, so he has (155)(75)\binom{15}{5} - \binom{7}{5} possible winning hands.

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.