Applications of prime numbers

Simple item page
dc.contributor.advisorOdell, E. (Edward)en
dc.contributor.committeeMemberDaniels, Marken
dc.creatorSchuler, Paul Lavelleen
dc.date.accessioned2012-11-27T19:59:50Zen
dc.date.accessioned2017-05-11T22:30:06Z
dc.date.available2012-11-27T19:59:50Zen
dc.date.available2017-05-11T22:30:06Z
dc.date.issued2012-08en
dc.date.submittedAugust 2012en
dc.date.updated2012-11-27T19:59:57Zen
dc.descriptiontexten
dc.description.abstractThis report explores the historical development of three areas of study regarding prime numbers. The attempt to find an efficient and useful function to generate primes could be a helpful tool in the improvement of encryption. The difficulty of factoring large numbers allows the Rivest, Shamir and Adleman algorithm to be effective for public key cryptography. The distribution of primes is examined through discussion of the prime number theorem and the Riemann hypothesis. A brief case for integrating elementary number theory in secondary curriculum is also included.en
dc.description.departmentMathematicsen
dc.format.mimetypeapplication/pdfen
dc.identifier.slug2152/ETD-UT-2012-08-5929en
dc.identifier.urihttp://hdl.handle.net/2152/ETD-UT-2012-08-5929en
dc.language.isoengen
dc.subjectPrime numbersen
dc.titleApplications of prime numbersen
dc.type.genrethesisen

Files

Collections

University of Texas at Austin