This thesis has been motivated largely by Lehmer's problem [20], which was stated in 1933 and it is still a problem that mathematicians have not completely solved. The Mersenne sequence, (2n-1)nen has properties that make it useful for finding large primes but its terms become very large very fast. Lehmer's problem is related to finding large primes in sequences that are analogous to the Mersenne sequence but that grow as slowly as possible and Lehmer's conjecture implies a lower bound on the growth rate of any such sequence.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:586611 |
| Date | January 2012 |
| Creators | Greaves, Gary |
| Publisher | Royal Holloway, University of London |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://repository.royalholloway.ac.uk/items/8bb0b4f8-863e-73d4-2bb8-f8596edc260b/10/ |
Page generated in 0.0021 seconds