2000 OIM Problems/Problem 5

Revision as of 15:17, 13 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == There is a pile of 2000 stones. Two players take turns removing stones, alternately, according to the following rules: 1. On each move you can remove 1, 2, 3, 4...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

There is a pile of 2000 stones. Two players take turns removing stones, alternately, according to the following rules:

1. On each move you can remove 1, 2, 3, 4 or 5 stones from the pile.

2. In each play, the player is prohibited from removing the same number of stones that his opponent removed in the previous play.

The player who cannot make a valid play on his turn loses. Find which player has a winning strategy and find it.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

https://www.oma.org.ar/enunciados/ibe15.htm