Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Euclidean Algorithm

Description

This lecture covers the Euclidean algorithm for polynomials over a field K. It explains how to compute the greatest common divisor (GCD) of two polynomials using the division with remainder method. The algorithm involves iteratively finding remainders until reaching a zero remainder, determining the GCD. Examples are provided to illustrate the algorithm's application, including the use of Bézout's identity and Gauss's lemma.

Official source

Ontological neighbourhood

Mathematics

Algebra: Abstract algebra

Related concepts (32)

Polynomial greatest common divisor

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 of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers. In the important case of univariate polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial GCD is defined only up to the multiplication by an invertible constant.

Bézout's identity

In mathematics, Bézout's identity (also called Bézout's lemma), named after Étienne Bézout, is the following theorem: Here the greatest common divisor of 0 and 0 is taken to be 0. The integers x and y are called Bézout coefficients for (a, b); they are not unique. A pair of Bézout coefficients can be computed by the extended Euclidean algorithm, and this pair is, in the case of integers one of the two pairs such that and equality occurs only if one of a and b is a multiple of the other.

Euclidean domain

In mathematics, more specifically in ring theory, a Euclidean domain (also called a Euclidean ring) is an integral domain that can be endowed with a Euclidean function which allows a suitable generalization of the Euclidean division of integers. This generalized Euclidean algorithm can be put to many of the same uses as Euclid's original algorithm in the ring of integers: in any Euclidean domain, one can apply the Euclidean algorithm to compute the greatest common divisor of any two elements.

Euclidean algorithm

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (300 BC). It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use.

Euclidean division

In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer (the dividend) by another (the divisor), in a way that produces an integer quotient and a natural number remainder strictly smaller than the absolute value of the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions. Because of this uniqueness, Euclidean division is often considered without referring to any method of computation, and without explicitly computing the quotient and the remainder.

Related lectures (55)

Ideals: Polynomials and Definitions

Explores ideals in K[X], including PGCD, uniqueness, coprimality, and theorems of Bézout and Gauss.

Polynomials: Roots and Factorization

Explores polynomial roots, factorization, and the Euclidean algorithm in depth.

Polynomials: Definition and Operations

Covers polynomials, their operations, division theorem, and provides illustrative examples.

Division Euclidienne: Exemples

Explains the Euclidean division of polynomials and demonstrates its application through examples and root-based divisibility.

Polynomials, Division, and Ideals