GCD and Euclidean Algorithm

Given a and b below, use the Euclidean Algorithm to find GCD(a, b).

Enter an integer in the field below, then click the "Submit" button. Do not place commas in the number.

Click "refresh" or "reload" to see another problem like this one.

Note: this is a typical exercise that you should be able to do, without a calculator, on a test.
You would be expected to write the details of each step, similar to the presentation shown when you click the "Get a clue" link.

Click here to get a clue


Copyright (c) 2012, James Wooland, all rights reserved.