On the number of partitions of n whose product of the summands is at most n
Abstract
We prove an explicit formula to count the partitions of n whose product of the summands is at most n. In the process, we also deduce a result to count the multiplicative partitions of n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.