DE-BUNDESWETTBEWERB 2002 Problem 5
- Round 2
A pile of cards, numbered with , , ..., , is being shuffled. Afterwards, the following operation is repeatedly performed: If the uppermost card of the pile has the number , then we reverse the order of the uppermost cards.
Prove that, after finitely many executions of this operation, the card with the number will become the uppermost card of the pile.
Dataset text AI-MO AoPS. Quoted with source.
Official text: Bundeswettbewerb Mathematik 2002 official paper, page 1.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.