Greatest Common Divisor

vCalc Reviewed
Equation / Last modified by KurtHeckman on 2016/08/05 16:26
`"GCD" = `
Rating
ID
vCalc.Greatest Common Divisor
UUID
e6d3d270-da27-11e2-8e97-bc764e04d25f

The greatest common divisor (GCD) of two positive integers, also known as the greatest common factor (GCF) or highest common factor (HCF) is the largest in the set of common numbers from the factors of the two input integers.  The Euclidean algorithm is a method for computing GCD.   It is named after the Greek mathematician Euclid, who described it in Books VII and X of his Elements.