Daily Math Puzzle 2026/11/05

Original Post on X

English

Let \(n\) be a positive integer. The numbers \(1\) through \(2n\) are written on \(2n\) cards, one number on each card, and the cards are divided into \(n\) pairs. For each pair, subtract the smaller number from the larger one, then add the \(n\) differences. How many distinct totals can be obtained by changing the pairing?

日本語

\(n\) を正の整数とする. \(1\) から \(2n\) までの数が一つずつ書かれた \(2n\) 枚のカードを,\(2\) 枚ずつ \(n\) 組に分ける. 各組で大きい数から小さい数を引き,得られた \(n\) 個の差をすべて足す. 組分けを変えると,この合計は何通りの値を取るか.

Try it