olymmath

OMCC 2008 Problem 3

  • Day 1

There are 2008 bags numbered from 1 to 2008, with 2008 frogs in each one of them. Two people play in turns. A play consists in selecting a bag and taking out of it any number of frongs (at least one), leaving xx frogs in it ( x≥0x\geq 0 ). After each play, from each bag with a number higher than the selected one and having more than xx frogs, some frogs scape until there are xx frogs in the bag. The player that takes out the last frog from bag number 1 looses. Find and explain a winning strategy.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator centro/2008/p3 · Tag 2YBSW9JSK8 · Edit this page on GitHub · Keys: j next, k previous