Bijection Intermediate

Problem - 4352

A partition of a positive integer $n$ is to write $n$ as a sum of some positive integers. Let $k$ be a positive integer. Show that the number of partitions of $n$ with exactly $k$ parts equals the number of partitions of $n$ whose largest part is exactly $k$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error