MathDB
2015 BMT Spring Discrete 10

Source:

January 20, 2022
combinatorics

Problem Statement

A partition of a positive integer nn is a summing n1+…+nk=nn_1+\ldots+n_k=n, where n1≥n2≥…≥nkn_1\ge n_2\ge\ldots\ge n_k. Call a partition perfect if every m≤nm\le n can be represented uniquely as a sum of some subset of the nin_i's. How many perfect partitions are there of n=307n=307?
Back to ProblemsView on AoPS