Self-Similarity of the 11-Regular Partition Function

dc.contributor.authorKopitzke, Grant
dc.date.accessioned2019-06-03T16:14:57Z
dc.date.available2019-06-03T16:14:57Z
dc.date.issued2017-12
dc.description.abstractThe partition function counts the number of ways a positive integer can be written as the sum of a non-increasing sequence of positive integers. These sums are known as partitions. The famous mathematician Srinivasa Ramanujan proved the partition function has beautiful divisibility properties. We will consider the k-regular partition function, which counts the partitions where no part is divisible by k. Results on the arithmetic of k-regular partition functions have been proven by several authors. In this paper we establish self-similarity results for the 11-regular partition function.en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/79142
dc.language.isoen_USen_US
dc.publisherUniversity of Wisconsin-Oshkosh Office of Student Research and Creative Activityen_US
dc.relation.ispartofseriesOshkosh Scholar;Volume XII
dc.subjectPartitions (Mathematics)en_US
dc.titleSelf-Similarity of the 11-Regular Partition Functionen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
11460 OshScholar18 Kopitzke.pdf
Size:
851.49 KB
Format:
Adobe Portable Document Format
Description:
Self-Similarity of the 11-Regular Partition Function

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.92 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections