Upper bound for the number of partitions of $n$ into exactly $k$ parts

157 Views Asked by At

Let $p_k(n)$ the number of partitions of $n$ into exactly $k$ parts. Do we have $p_k(n) \le 2^{n-k}$ ?

1

There are 1 best solutions below

0
On

The number of partitions of a set with $n$ elements into $k$ blocks is given by the Stirling number of the second kind $S(n,k)$. There is an explicit formula and a recursion formula for it.