Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

When playing around Wolfram Alpha, I find something interesting:

$\displaystyle \sum_{a_1=1}^n a_1=\frac 1 2 n(n+1)$

$\displaystyle \sum_{a_1=1}^n\sum_{a_2=1}^{a_1} a_2=\frac 1 6 n(n+1)(n+2)$

$\displaystyle \sum_{a_1=1}^n\sum_{a_2=1}^{a_1}\sum_{a_3=1}^{a_2} a_3=\frac 1 {24} n(n+1)(n+2)(n+3)$

I then deduce that $\displaystyle \sum_{a_1=1}^n\sum_{a_2=1}^{a_1}\sum_{a_3=1}^{a_2}...\sum_{a_m=1}^{a_{m-1}}a_m=\frac 1 {(m+1)!}\prod_{k=0}^m(n+k)$. But I don't know how to prove or disprove this. Please help. Thank you.

share|cite|improve this question
up vote 2 down vote accepted

Try to prove by induction.


$S_m(n) = \sum_{a_1=1}^n\sum_{a_2=1}^{a_1}\sum_{a_3=1}^{a_2}...\sum_{a_m=1}^{a_{m-1}}a_m$,

$S_{m+1}(n)= \sum_{a_0=1}^n\sum_{a_1=1}^{a_0}\sum_{a_2=1}^{a_1}\sum_{a_3=1}^{a_2}...\sum_{a_m=1}^{a_{m-1}}a_m=\sum_{a_0=1}^n S_m(a_0)$.

share|cite|improve this answer
induction, I believe? – Vincent Tjeng Mar 3 '13 at 14:28
@VincentTjeng oops...thanks. – Yimin Mar 3 '13 at 14:29

Note that$ a_m=\sum_1^{a_m}1$

Your question is now that of finding the size of the set;

$n\geq a_m \geq a_{m-1}\geq...\geq a_1 \geq 1$

Note that this is the same as finding no.s $x_i$ such that $n\geq x_i\geq0$ and $\sum x_i=n$ ( Think differences). Now can you do it? I may have made a mistake , here or there but the idea's fine I think.

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.