A Pebble Game

8/10combinatoricsInductionCasework

Problem

Two players take turns removing pebbles from a pile of 1515; each turn removes 11, 22, or 33 pebbles, and play ends when the pile is empty. The player who has taken an odd total number of pebbles wins. Does either player have a winning strategy? Justify your answer.

Answer

Solution

Difficulty8/10
Topicscombinatorics, Induction, Casework

Whiteboard

Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.

Discussion

Ask questions, share alternate solutions, and use LaTeX freely.

0 comments
Log in to join the discussion.

No comments yet.