The Number of Parts in the (Distinct) Partitions With Parts From a Set
Abstract
The number of parts in the partitions (resp. distinct partitions) of n with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the number of prime divisors of n, p-adic valuation of n, the number of Carlitz-binary compositions of n and the Hamming weight function. Finally, we obtain an asymptotic estimate for the number of parts in the partitions of n with parts from a finite set of relatively prime integers.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.