Journal of the Indian Mathematical Society · 1942 · 14 citations · 0 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDiscrete MathematicsCombinatorial EnumerationCombinatorial Number TheoryEnumerative CombinatoricsInteger PartitionsEuler's Partition TheoremPartition FunctionPartition Generating FunctionsPartitioning ProblemsRestricted Partitions
Let p k (n) denote the number of partitions of n into exactly k parts. We obviously have Σ p k (n) = p(n), where p(n) denotes the number of unrestricted partitions of n, a function introduced by Euler.