Greatest Common Divisor

A small tool for calculating the greatest common divisor (GCD) of two numbers, just enter the numbers and press enter.

Number 1
Number 2
GCD

I am using Euclid’s algorithm which is an efficient algorithm for calculating the Greatest Common Divisor (GCD).

If you are interested in the source code, the C# equivalent of the source code is explained in my solution to problem 9 of Project Euler, otherwise just peek at the source code for this page, there is nothing secret about it.

This site uses cookies.