Greatest common divisor

From Conservapedia
This is the current revision of Greatest common divisor as edited by DavidB4-bot (Talk | contribs) at 08:38, 13 July 2016. This URL is a permanent link to this version of this page.

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

The greatest common divisor (GCD) or greatest common factor of two natural numbers is the largest natural number which evenly divides them both. For example, the greatest common divisor of 62 and 64 is 2 since no bigger number evenly divides both 62 and 64, even though larger numbers evenly divide 62 and 64. Sometimes the notation (62,64)=2 is used. The Euclidean algorithm calculates greatest common divisors.