olymmath

ELMO SL 2010 C7

    The game of circulate is played with a deck of knkn cards each with a number in 1,2,…,n1,2,\ldots,n such that there are kk cards with each number. First, nn piles numbered 1,2,…,n1,2,\ldots,n of kk cards each are dealt out face down. The player then flips over a card from pile 11 , places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the kk cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game?

    Brian Hamrick.

    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 elmo-sl/2010/c7 · Tag HFM94H7KVB · Edit this page on GitHub · Keys: j next, k previous