Math and Computer Science Honors Theses

The Theory of Partitions

Date of Creation

5-18-2015

Document Type

Departmental Honors Thesis - Restricted Access

Department

Mathematics

First Advisor

Cristina Ballantine

Abstract

The partition of a positive integer n is a way to write n as a sum of positive integers where the order doesn't matter. The partition function p(n) counts the number of different partitions of n. In this thesis, I will present several important identities involving the partition function. including Euler's identity and the Rogers-Ramanujan identities, as well as some of the history of the theory of partitions.

This document is currently not available here.

Share

COinS