Number Theory: Greatest Common Divisor and Prime Factorization

Related lectures (28)

Page 1 of 3

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

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

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

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

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

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

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

Covers function composition and integers, including properties and examples.

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

Covers the fundamental theorem of arithmetic, focusing on equivalence and irreducibility of integers.