Greatest Common Divisor
Jump to navigation
Jump to search
A Greatest Common Divisor is the integer produced by the greatest common divisor operation [math]\displaystyle{ \gcd \left({S}\right) }[/math].
- AKA: gcd, Greatest Common Factor, Highest Common Factor.
- See: Euclid's Algorithm.
References
2013
- http://en.wikipedia.org/wiki/Greatest_common_divisor
- In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more integers (at least one of which is not zero), is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.
This notion can be extended to polynomials, see Polynomial greatest common divisor, or to rational numbers (with integer quotients).
- In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more integers (at least one of which is not zero), is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.