Library / United States competition problems /31 of 37

United States competition problems

Combinatorics Difficulty 5.2 AIME, harder Prove it United States

Problem:

Alex and Bob have $30$ matches. Alex picks up somewhere between one and six matches (inclusive), then Bob picks up somewhere between one and six matches, and so on. The player who picks up the last match wins. How many matches should Alex pick up at the beginning to guarantee that he will be able to win?

Solution

Solution:

$2$ .

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

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