Euclid's Algorithm Applet
The applets on this page demonstrates how Euclid's Algorithm can be
used to quickly compute the greatest common divisor of two positive
integers. Euclid's Algorithm makes repeated use of the fact that
gcd(a,b) = gcd(b, r) where r is the remainder when a is divided by b.
The "scratch paper" shows the work involved in this computation.
The first applet runs faster.
The second applet runs more slowly and requires a newer version of
java, but it displayed the results in color.
This page maintained by:
Randall Pruim
Department of Mathematics and Statistics
Calvin College
rpruim@calvin.edu
Last Modified:
Wednesday, 26-Sep-2001 15:08:55 EDT