Lecture 6: 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


Also study Maple's Power, mod, mods, and chrem functions.


Maple worksheets and programs and other resources


Created: Oct. 20, 2005 by jjohnson@cs.drexel.edu