On Some Recurrence Relations for Partition Functions

Simple item page
dc.contributor.advisorDaniel Berhanu
dc.contributor.authorGosa Tekola
dc.date.accessioned2025-08-31T22:23:51Z
dc.date.available2025-08-31T22:23:51Z
dc.date.issued2016-09
dc.description.abstractDespite the definition of integer partition function is simple, many results on integer partitions can be shockingly difficult to obtain. The thesis comprises of introductory properties and topic ofsome recurrence relations for additive partition functions. In particular, it provides a formula for p(z) to find the number of partitions of positive integer z .We proved some recurrence relations for restricted partition functions. At the end, a chart showing values of of p (z) for integers 1< Z > 280 is included.
dc.identifier.urihttps://etd.aau.edu.et/handle/123456789/7241
dc.language.isoen_US
dc.publisherAddis Ababa University
dc.subjectSome Recurrence Relations
dc.subjectPartition Functions
dc.titleOn Some Recurrence Relations for Partition Functions
dc.typeThesis

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Gosa Tekola 2024.pdf
Size:
1.15 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

Mathematics