Uploaded February 2021 | Updated September 2026, 7 hours ago
In this video we count the number of partitions with m or fewer parts such that the largest part is at most n. We solve this by finding a bijection with a set of objects that are easy to count.
In this video we count the number of partitions with m or fewer parts such that the largest part is at most n. We solve this by finding a bijection with a set of objects that are easy to count.










