Euclidean algorithm

Related lectures (28)

Page 2 of 3

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

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

Covers the Chinese remainder theorem for commutative rings and integers, polynomial rings, and Euclidean domains.

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

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

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

Introduces sets, maps, divisors, prime numbers, and arithmetic principles related to integers.

Explores total order broadcast and its equivalence to consensus in reliable systems.

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

Covers the basics of number theory, RSA encryption, and Shor's period finding algorithm.