In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of...

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

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...

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

extension to 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...

norm 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...

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

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...

lowest common multiple of the denominators of a set of fractions Greatest common divisor, the largest positive integer that divides each of the integers...

quotients of a and b (respectively) by the greatest common divisor of a and b. Proof: If d is this greatest common divisor, Bézout's identity asserts the existence...