2014 CHMMC Tiebreaker 3 - 2 players- game on a pile of n beans
Source:
March 1, 2024
combinatoricsnumber theoryCHMMC
Problem Statement
Two players play a game on a pile of beans. On each player's turn, they may take exactly , , or beans from the pile. One player goes first, and then the players alternate until somebody wins. A player wins when they take the last bean from the pile. For how many between and (inclusive) does the second player win?