OmegaSoft Development Blog
The greatest common divisor
09 July 2007 - 04:16 PM
"The greatest common divisor of a and b is written as gcd(a, b), or sometimes simply as (a, b). For example, gcd(12, 18) = 6, gcd(−4, 14) = 2 and gcd(5, 0) = 5. Two numbers are called coprime or relatively prime if their greatest common divisor equals 1. For example, 9 and 28 are relatively prime.
"The greatest common divisor is useful for reducing vulgar fractions to be in lowest terms."
-Wikipedia
Calculate GCD below:
research.omegasoft.co.uk/labs/gcd/
Seb Harvey