MATH 139 SPRING 2003

Extended Euclidean Algorithm Computer
Runs the extended Euclidean algorithm to express the GCD of two numbers a and b in the form as + bt.

a=
b=
gcd(a,b)=
= x
+ x

The program is written in JavaScript, and runs on the client computer. Most implementations seem to handle numbers of up to 16 digits correctly.