benchmarks.wiki / Public workspace

Omni-MATH / Two players, A and B, play the following game: they retire coins of a pile which…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Two players, A and B, play the following game: they retire coins of a pile which contains initially 2006 coins. The players play removing alternatingly, in each move, from 1 to 7 coins, each player keeps the coins that retires. If a player wishes he can pass(he doesn't retire any coin), but to do that he must pay 7 coins from the ones he retired from the pile in past moves. These 7 coins are taken to a separated box and don't interfere in the game any more. The winner is the one who retires  the last coin, and A starts the game. Determine which player can win for sure, it doesn't matter how the other one plays. Show the winning strategy and explain why it works.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import