Daily Math Puzzle 2026/11/10

Original Post on X

English

There are \(2n\) islands (\(n\geq 2\)) and some bridges connecting them. Between any two islands, there is exactly one path connecting them. Your task is to divide the islands into pairs so that the paths connecting the pairs all pass through a common island. Prove that such a pairing is always possible.

日本語

\(2n\) 個(\(n\geq 2\))の島と,島を結ぶ何本かの橋がある. どの二つの島の間にも,それらを結ぶ経路がちょうど一つある. あなたの仕事は,島を二つずつの組に分け,各組を結ぶ経路が共通の島を通るようにすることである. このような組分けが常にできることを示せ.

Try it