1

Let $g(n,k)$ be the number of partitions of $n$ into exactly $k$ parts, in which no part is a $1$. Show that $$g(n,k) = g(n-2,k-1) + g(n-k,k).$$

How would I show this?

Saketh Malyala
  • 13,637
  • 1
    You would think about the problem. You would understand how the two terms on the right contribute all the solutions on the left and do not double count. – Ross Millikan Jul 08 '15 at 04:31

0 Answers0