On the number of partitions of a number into distinct divisors
Abstract
Let pdsd (n) be the number of partitions of n into distinct squarefree divisors of n. In this note, we find a lower bound for pdsd (n), as well as a sequence of n for which pdsd (n) is unusually large.
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.