Partitioning
Integers
by: Sharon Jancha
Abstract: The Partition Function, p(n), is defined to be the number of ways an integer n can be written as a sum of positive integers less than or equal to n. We will briefly discuss some individuals who have influenced this topic, as well as the formulas used for finding the number of partitions of any given integer. We will also examine ways of illustrating the partitions of an integer using both Ferrers graphs and rectangular blocks, noting patterns that are found within them. Finally, we will construct a triangle to find the number of partitions for a given integer.
|
|