HMMT 2004 T6

Prove that the number of odd numbers in row $n$ is at most twice the number of switch pairs in row $n-1$ .

Dataset text NuminaMath olympiads. 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.