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

Concept

Euclidean algorithm

Related lectures (28)

Polynomials: Roots and Factorization

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

Euclid and Bézout: Algorithms and Theorems

Explores the Euclidean algorithm, Bézout's identity, extended Euclid algorithm, and commutative groups in mathematics.

System Equivalence

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

Shor's Factoring Algorithm

Covers Shor's factoring algorithm, aiming to find integer factors efficiently using quantum computation.

Number Theory: GCD and LCM

Covers GCD, LCM, and the Euclidean algorithm for efficient computation.

Number Theory: GCD and LCM

Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.

Algorithms for Big Numbers: Z_n and Orders

Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.

Polynomial Factorization over Finite Fields

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

The Greatest Common Divisor MOOC: Analysis I (part 1): Prelude, basic concepts, real numbers MOOC: Analysis I

Covers the greatest common divisor, Euclidean algorithm, Joseph Stein's algorithm, and practical examples.

Rudiments of Number Theory

Introduces modulo arithmetic, Euclid's algorithm, and congruence in number theory.

Optimisation with Constraints: Interior Point Algorithm

Explores optimization with constraints using KKT conditions and interior point algorithm on two examples of quadratic programming.

Introduction to Algorithms

Introduces algorithms as problem-solving procedures, covering complexity, correctness, and implementation in various languages.

Connect Four: Winning Strategy

Explains the winning strategy in Connect Four by checking for winning combinations.

Polynomial Methods: GCD Calculation Summary

Covers the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.

Untitled

Euclidean Algorithm

Explains the Euclidean algorithm for polynomials over a field K, illustrating its application with examples.

Shor Algorithm: Period Finding Log in to Mediaspace to watch this video

Covers the Shor Algorithm for period finding and its application in factorization, discussing the circuit implementation and measurement outcomes.

Euclidean Algorithm: GCD Calculation Log in to Mediaspace to watch this video

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

Properties of Euclidean Domains Log in to Mediaspace to watch this video

Covers the properties of Euclidean domains and irreducible elements in polynomial rings.

Algebra: Integer Numbers and Principles Log in to Mediaspace to watch this video

Introduces integer numbers, well-ordering, induction principles, GCD, LCM, and Bezout's theorem.