Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The distinct positive integers $a_1,a_2,...,a_n,b_1,b_2,...,b_n$ with $n\ge2$ have the property that the $\binom{n}2$ sums $a_i+a_j$ are the same as the $\binom{n}2$ sums $b_i+b_j$ (in some order). Prove that $n$ is a power of $2$.

I've seen a solution using generating function and some calculus, but is there a more intuitive proof why $n$ has to be a power of $2$?

share|cite|improve this question
The fellow who wrote says he doesn't know a proof without generating functions. – Gerry Myerson Aug 13 '13 at 11:25

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.