Lectures related to Number Theory: GCD and LCM

Explores cosets in commutative groups, Lagrange theorem, and integer factorization.

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

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 the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.

Covers groups, rings, number theory, atomic bonds, and materials structure, setting the foundation for further exploration.

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

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