HMMT 二月 2001 · 冲刺赛 · 第 59 题
HMMT February 2001 — Guts Round — Problem 59
题目详情
英文原题
- [10] Trevor and Edward play a game in which they take turns adding or removingbeans from a pile. On each turn, a player must either add or remove the largest perfectsquare number of beans that is in the heap. The player who empties the pile wins. Forexample, if Trevor goes first with a pile of 5 beans, he can either add 4 to make the total
9, or remove 4 to make the total 1, and either way Edward wins by removing all the beans.
There is no limit to how large the pile can grow; it just starts with some finite number ofbeans in it, say fewer than 1000.
Before the game begins, Edward dispatches a spy to find out how many beans will be inthe opening pile, call this n , then “graciously” offers to let Trevor go first. Knowing that the first player is more likely to win, but not knowing n , Trevor logically but unwisely accepts,
and Edward goes on to win the game. Find a number n less than 1000 that would promptthis scenario, assuming both players are perfect logicians. A correct answer is worth thenearest integer to log ( n − 4) points. 2
解析
英文解析
- [10] Trevor and Edward play a game in which they take turns adding or removingbeans from a pile. On each turn, a player must either add or remove the largest perfectsquare number of beans that is in the heap. The player who empties the pile wins. Forexample, if Trevor goes first with a pile of 5 beans, he can either add 4 to make the total
9, or remove 4 to make the total 1, and either way Edward wins by removing all the beans.
There is no limit to how large the pile can grow; it just starts with some finite number ofbeans in it, say fewer than 1000.
Before the game begins, Edward dispatches a spy to find out how many beans will be inthe opening pile, call this n , then “graciously” offers to let Trevor go first. Knowing that the first player is more likely to win, but not knowing n , Trevor logically but unwisely accepts,
and Edward goes on to win the game. Find a number n less than 1000 that would promptthis scenario, assuming both players are perfect logicians. A correct answer is worth thenearest integer to log ( n − 4) points.
Solution: The correct answers are 0 (worth imaginary points), 5 (worth 0 points), 202
(4 points), 29, 45 (5 points), 80 (6 points), 101, 116, 135, 145, 165, 173 (7 points), 236, 257
(8 points), 397, 404, 445, 477, 540, 565, 580, 629, 666 (9 points), 836, 845, 885, 909, 944,
949, 954, 975 (10 points). This game is called Epstein’s Put-or-Take-a-Square game. It isunknown whether or not these numbers (or the first player’s win positions) have positivedensity.