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

Lecture

Chinese Remainder Theorem and Euclidean Domains

In course

MATH-310: Algebra

This is an introduction to modern algebra: groups, rings and fields. ...

Description

This lecture covers the Chinese remainder theorem for integers, solving systems of congruences, and the multiplicative property of the Euler totient function. It also delves into polynomial rings, the degree of polynomials over integral domains, Euclidean division, and the definition of a Euclidean domain. Examples are provided to illustrate the concepts discussed.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Anna Lachowska

Official source

Ontological neighbourhood

Mathematics

Algebra: Abstract algebra

Related concepts (32)

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.

Polynomial ring

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, often a field. Often, the term "polynomial ring" refers implicitly to the special case of a polynomial ring in one indeterminate over a field. The importance of such polynomial rings relies on the high number of properties that they have in common with the ring of the integers.

Chinese remainder theorem

In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime (no two divisors share a common factor other than 1). For example, if we know that the remainder of n divided by 3 is 2, the remainder of n divided by 5 is 3, and the remainder of n divided by 7 is 2, then without knowing the value of n, we can determine that the remainder of n divided by 105 (the product of 3, 5, and 7) is 23.

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.

Related lectures (33)

Polynomial Factorization over Finite Fields

Introduces polynomial factorization over finite fields and efficient computation of greatest common divisors of polynomials.

Euclidean Division: Uniqueness and Remainder

Explores Euclidean division for polynomials, emphasizing uniqueness of quotient and remainder.

Polynomials: Definition and Operations

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

System Equivalence

Explores system equivalence, state-space representation, transfer functions, and Euclidean rings, emphasizing unimodular matrices and their properties.

Decimal Expansion: Division and Periodicity