Take the 2-minute tour ×
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.

a) Let $s_n$ denote the number of ways of expressing $n$ as a sum of positive integers. Thus $s_1=1$, $s_2=2$, and $s_3=4$ (the four ways are $3$, $2+1$, $1+2$, and $1+1+1$). Prove that $s_n=s_{n-1}+s_{n-2}+\cdots+s_1+1$. Hence calculate $s_{10}$. Find a formula for $s_n$ in terms of $n$.

b) Suppose that we decide not to distinguish between '$1+2$' and '$2+1$'; Let $\sigma_n$ denote the number of ways of expressing $n$ as a sum of positive integers when the order of the terms does not matter. Thus $\sigma_3=3$. Calculate $\sigma_n$ ($1\leqslant n\leqslant 6$). Find $\sigma_{10}$. Express the $n$th term $\sigma_n$ in terms of earlier terms. Then try to find a formula for $\sigma_n$ in terms of $n$.

I need help on part (b). I've done part (a), which was easy enough ($2^{n-1}$).

I'm struggling to find a formula for $\sigma_n$ though.

This is an exercise from "The Mathematical Olympiad Handbook - An introduction to problem solving".

share|improve this question
This is the number of partitions of $n$. You will not find a nice closed form formula. –  André Nicolas Nov 6 '13 at 19:11

1 Answer 1

up vote 1 down vote accepted

As Andre pointed no nice closed form but exists a beautiful recurrence given by Euler $$p(k)=\sigma_k=\sum_{d=1}^{\infty}(-1)^{d+1}\left(p\left(k-\frac{d(3d-1)}{2}\right)+ p\left(k-\frac{d(3d+1)}{2}\right)\right)$$

share|improve this answer
Hi my dear Adi :+) –  B. S. Nov 8 '13 at 6:58

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.