---

This uses Euclid's 2000+ year old algorithm to compute the GCD of the two numbers entered. It is required that you enter only positive numbers.

---

The first number: The second number: The result is:

---

I:
J:
R:

Step 1: Call the larger value I and the smaller value J. Step 2: Divide I by J and call the remainder R. Step 3: If R is not 0, then reset I to the value of J reset J to the value of R go back to step 2 Step 4: Print out the answer, which is the value of J