Explore: Common Divisor

In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the

The lowest common divisor is a term often mistakenly used to refer to: Lowest common denominator, the lowest common multiple of the denominators of a set

In mathematics, a divisor of an integer n , {\displaystyle n,} also called a factor of n , {\displaystyle n,} is an integer m {\displaystyle m} that may

phrase least common divisor is a confusion of the following two distinct concepts in arithmetic: Least common multiple Greatest common divisor This disambiguation

In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor

several ways to compute least common multiples. The least common multiple can be computed from the greatest common divisor (gcd) with the formula lcm ⁡

N(d) of the greatest common divisor of a and b is a common divisor of N(a), N(b), and N(a + b). When the greatest common divisor D of these three integers

following theorem: Bézout's identity—Let a and b be integers with greatest common divisor d. Then there exist integers x and y such that ax + by = d. Moreover

Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without

the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity