Daily Math Puzzle 2026/11/13

Original Post on X

English

Between two buildings of height \(n\), arrange one building of each height \(1,2,\ldots,n-1\) in a row. Two buildings can communicate if and only if every building between them is shorter than both.

Find all integers \(n\ge 2\) for which some arrangement gives every building, including the two at the ends, an even number of communication partners.

日本語

高さ \(n\) のビル二棟の間に,高さ \(1,2,\ldots,n-1\) のビルを一棟ずつ一列に並べる. 二棟のビルが通信できるのは,間にあるビルがすべて,その二棟のどちらよりも低いときである.

両端も含め,各ビルが通信できる相手の数を偶数にしたい. これが可能な整数 \(n\ge 2\) をすべて求めよ.

Try it