Part one - Florida Atlantic University

The Euclidean Algorithm is used to find the greatest common divisor between two numbers. It is the solution to Proposition VII.2 in Euclid’s Elements: “To find the greatest common measure of two given numbers not relatively prime”. The algorithm is based on the following lemma with two observations: ................
................