Back to search

Clemson University

<i>m</i>-ARY Partitions

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ganguly, Soumendra
Contributors dc:contributor
  • Kevin James, Committee Chair
  • Hui Xue
  • Felice Manganiello

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/3165

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ganguly, Soumendra. <i>m</i>-ARY Partitions. Thesis thesis, https://open.clemson.edu/all_theses/3165