Lectures related to Number Theory: GCD and LCM

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

Covers Shor's factoring algorithm and the link between order finding and factoring.

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

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

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

Explores the history and concepts of Number Theory, including divisibility and congruence relations.

Introduces Cartesian product and induction for proofs using integers and sets.

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