Extended Euclidian GCD Calcula

This application was designed for students who want to learn Euclid's algorithm for greatest common divisor and Bezout identity at cryptography course.

You can start by entering two numbers. By default 2 random numbers will be displayed in text boxes. After you start the program, by clicking next step each iteration will be shown on your screen.

The columns X and Y represent Bezout coefficients. The number will be sorted so X is for the greatest one and Y for the lowest.

You can use this application on many other purposes because of Euclid's algorithm utility.