First Advisor
Derek Garton
Date of Award
3-3-2017
Document Type
Thesis
Degree Name
Bachelor of Science (B.S.) in Mathematics and University Honors
Department
Mathematics and Statistics
Subjects
Partitions (Mathematics), Number theory, Generating functions
DOI
10.15760/honors.358
Abstract
Partitions are a subject of study in the field of number theory and have been studied extensively since the eighteenth-century mathematician Leonhard Euler's work on them. More famously, Srinivasa Ramanujan was credited for advancing the field of partition theory with his discoveries in the early 1900's. In the late 1960’s, R.F. Churchouse extensively studied congruences of the binary partition function and made many conjectures about their properties, which went unproven for a time. Some of these were soon after proven by Ø. Rødseth and generalized to p-ary partitions where p is a prime number. In 2015, Andrews et al. proved a surprising and entirely unexpected generalization of the m-ary partition function modulo m that utilized generating functions and elementary techniques; this generalization is the focus of this thesis.
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Persistent Identifier
http://archives.pdx.edu/ds/psu/19519
Recommended Citation
Ortiz, Jose A., "Integer Partitions and Why Counting Them is Hard" (2017). University Honors Theses. Paper 365.
https://doi.org/10.15760/honors.358