Lecture: Modular Arithmetic and Fast Powering

This lecture introces the concept of modular arithmetic and presents a fast algorithm to compute the power of a number modulo another number. Constructive algorithms, based on the extended Euclidean algorithm, to compute modular inverses and solve the Chinese Remainder problem is presented. Finally, a modular algorithm for integer multiplication is discussed.

Background Material




Maple worksheets and programs and other resources

Practice Assignment

Created: April 21, 2008 (revised Sept. 28, 2016) by jjohnson AT cs DOT drexel DOT edu