GCD Calculator (Euclid's Algorithm)

This cgi-bin form calculates the greatest common divisor of two positive integers using Euclid's classic algorithm.

N1 (200-digit maximum):

N2 (200-digit maximum):

This web page is maintained by David T. Ashley, was last updated on April 6, 2008, required approximately 0.000072s (0.000072s user, 0.000000s system) to generate, and is part of esrgweba version 0.00a.  Local time on this server (at the time the page was served) is 11:51:05 am (UTC, GMT +0000) on February 25, 2018.