Search Results

MATH 436. Number Theory for Applications. 3 or 4 hours.

Primality testing methods of Lehmer, Rumely, Cohen-Lenstra, Atkin. Factorization methods of Gauss, Pollard, Shanks, Lenstra, and quadratic sieve. Computer algorithms involving libraries and nested subroutines. Course Information: 3 undergraduate hours. 4 graduate hours. Prerequisite(s): Grade of C or better in MATH 435.