### Millersville University/Department of Mathematics

## Extended Euclidean Algorithm Applet

The Euclidean Algorithm is a simple means by which the greatest common
divisor (GCD) of two positive integers may be found.
The Java applet below makes use of the `BigInteger`

class
and thus should handle arbitrarily large integers.
In addition to the GCD of *A* and *B*, this applet will also
express the GCD as a linear combination of *A* and *B*.

If you find a case in which the applet fails to function or gives
erroneous results, please send me the values of *A* and *B*
which you entered and the contents of your Java console.
My modest goal is to have this applet run reliably and accurately.

Last updated: