This 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. / text
| Identifer | oai:union.ndltd.org:UTEXAS/oai:repositories.lib.utexas.edu:2152/ETD-UT-2012-08-5929 |
| Date | 27 November 2012 |
| Creators | Schuler, Paul Lavelle |
| Source Sets | University of Texas |
| Language | English |
| Detected Language | English |
| Type | thesis |
| Format | application/pdf |
Page generated in 0.0016 seconds