primes
Mathematical Programming with Python
https://people.sc.fsu.edu/~jburkardt/classes/...
python_2025/primes/primes.html

primes: searching for all prime numbers over a given range. Improving the efficiency of the search. Testing a particular number for primality. Measuring the time required by a calculation. Fermat and Mersenne primes.

Lecture notes:

• primes.pdf

Blowup: Can we compute large integers?

• blowup.c
• blowup.m
• blowup.py

The sieve of Eratosthenes:

• eratosthenes.py

Versions of the is_prime() function:

• is_prime1.py
• is_prime2.py
• is_prime3.py
• is_prime4.py

The Miller-Rabin primality test:

• miller_rabin.py

The Lucas-Lehmer primality test:

• lucas_lehmer.py

Counting primes:

• prime_pi.py
• prime_pi.png

Timing the prime calculation:

• prime_timer.py

A timer:

• timer.py, compare the time required by sympy's isprime() and our is_prime3().

Assignment #2 due on Friday, 31 January:

• Assignment 02