Maths Olympiad Prep

Library / /159 of 520

Combinatorics Difficulty 5.0 AIME Find the answer

5. There are 1993 matches on the table. Two children, A and B, take turns to pick up 1, 2, or 3 matches each time. The one who picks up the last match wins. If A goes first, which child will win? How should he play this game?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

5. Player A can win. Note that as long as the number of matches left after Player A's turn is a multiple of 4. Since 1993 is a number of the form 4k+14k+1. Player A takes 1 match first, leaving 1992 matches, which is a multiple of 4. Thereafter, when Player B takes 1, 2, or 3 matches, Player A takes 3, 2, or 1 matches respectively, thus keeping the total number of matches taken by both to 4. Player A will then win.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.