The proof of the Primitive Divisor Theorem

dc.contributor.authorSias, Mark Anthony
dc.date.accessioned2016-10-26T06:59:45Z
dc.date.available2016-10-26T06:59:45Z
dc.date.issued2016
dc.descriptionA research report submitted to the Faculty of Science, in partial fulfilment of the requirements for the degree of Master of Science, University of the Witwatersrand, Johannesburg, May 2016.
dc.description.abstractThis dissertation provides the main results leading to its primary aim, the proof of the Primitive Divisor Theorem, by appealing to an electric potpourri of mathematical machinery. The employment of binary recurrent sequences with related results is crucial to the approach adopted. The various forms in which the theorem manifests are attributed, among others, to K. Zsigmondy, P.D. Carmichael, and Y. Bilu, G. Hanrot and P.M. Voutier. The proof is confined to instances where the roots of the characteristic polynomial are integers, and when the roots are reals. This dissertation culminates in the resolution of a Diophantine equation which serves as an application of the Primitive Divisor Theorem that is attributed to Carmichael.
dc.description.librarianGR 2016en_ZA
dc.format.extentOnline resource (34 leaves)
dc.identifier.citationSias, Mark Anthony (2016) The proof of the Primitive Divisor Theorem, University of Witwatersrand, Johannesburg, <http://wiredspace.wits.ac.za/handle/10539/21293>
dc.identifier.urihttp://hdl.handle.net/10539/21293
dc.language.isoenen_ZA
dc.subject.lcshDivisor theory
dc.subject.lcshDiophantine analysis
dc.titleThe proof of the Primitive Divisor Theoremen_ZA
dc.typeThesisen_ZA

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Mark Sias MSc Dissertation.pdf
Size:
1.36 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections