Daily Math Puzzle 2026/11/09
English
There are \(n\geq2\) cards, numbered \(1\) through \(n\), arranged in a row. In one operation, choose any number of disjoint pairs of cards (possibly zero) and simultaneously swap the two cards in each pair. Prove that, regardless of their initial arrangement, the cards can be put in increasing order from left to right in two operations.
日本語
\(n\geq2\) 枚のカードに1から \(n\) までの数が一つずつ書かれ,横一列に並んでいる. 1回の操作では,同じカードを重複して選ばないように2枚組をいくつか選び,各組の2枚を同時に交換する(0組でもよい). どんな並びからでも,この操作を2回行うことで,左から小さい順に並べ直せることを示せ.
Try it
- Rounds used
- 0 / 2
- Pairs selected
- 0
Select two cards to connect them; tap a paired card to unlink it.