Generalizations of Euler's Theorem to k-regular partitions
Abstract
Let Ak(n) denote the set of k-distinct partitions of n, and let Bk(n) be the set of k-regular partitions of n. Glaisher showed that \# Ak(n) = \# Bk(n). For k=2, this equality yields the celebrated Euler's partition theorem. In this paper, we present a new partition set Ek(n), which is equinumerous to Bk(n).
0
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.