Difference between revisions of "Greatest common divisor"
Jump to navigation
Jump to search
(basic math topic) |
(Divides evenly.) |
||
| Line 1: | Line 1: | ||
| − | The '''greatest common divisor''' ('''GCD''') or '''greatest common factor''' of two [[natural number]]s is the largest natural number which divides them both. For example, the greatest common divisor of 62 and 64 is 2 since no bigger number divides ''both'' 62 and 64, even though larger numbers divide 62 and 64. Sometimes the notation (62,64)=2 is used. The [[Euclidean algorithm]] calculates greatest common divisors. | + | The '''greatest common divisor''' ('''GCD''') or '''greatest common factor''' of two [[natural number]]s 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. |
[[Category:mathematics]] | [[Category:mathematics]] | ||
Revision as of 10:34, December 11, 2008
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.