Lecture 5: Finding Large Primes - Mersenne Primmes

Background Material



  1. Euclid's proof that there are infinitely many primes.
  2. Proof that there are infinitely large gaps between consecutive primes.
  3. Perfect numbers and Mersenne primes.
  4. Lucas-Lehmer algorithm - need for arbitrary precision integer arithmetic and fast integer multiplication.

Slides and Lecture Notes

  1. infprimes.pdf - hand written notes from the lecture.

Maple worksheets and other resources

Created: April 14, 2008 by jjohnson AT cs DOT drexel DOT edu