Date of Award
Master of Science (MS)
Kevin James, Committee Chair
We study the number of ways in which n ≥ 0 be written as the sum of powers of m ≥ 2. After briefly discussing historical results and examples, we prove recurrence relations, exact formulae, bounds, and asymptotic formulae. The proofs are based on elementary reasoning using induction and the mean value theorem.
Ganguly, Soumendra, "m-ARY Partitions" (2019). All Theses. 3165.