Proof WritingHardProblem-Solving Strategies
Problem-Solving Strategies · Hard problem
Players alternately take , or counters (a perfect square) from a pile of ; whoever takes the last counter wins. How many of the three possible first moves win?
Players alternately take , or counters (a perfect square) from a pile of ; whoever takes the last counter wins. How many of the three possible first moves win?