Number Theory: GCD and LCM

Related lectures (28)

Page 1 of 3

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

Introduces greatest common divisor, prime factorization, and the Euclidean Algorithm.

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

Explores prime numbers, coprime integers, and their properties in number theory.

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.

Covers the basics of Shor's algorithm for factoring integers and the steps involved in the quantum algorithm.

Explores well ordering, induction, Euclidean division, and prime factorization in integers.

Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.

Covers function composition and integers, including properties and examples.

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