Lectures related to Number Theory: GCD and LCM

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.

Delves into the complexity of factoring polynomials and the implications for security.

Covers prime numbers, unique decomposition of natural numbers into prime factors, and practical implications for calculations.

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

Explores polynomial roots, factorization, and the Euclidean algorithm in depth.

Introduces integer numbers, well-ordering, induction principles, GCD, LCM, and Bezout's theorem.

Covers the factorization of polynomials over a field, including division with remainder and common divisors.

Covers integers, rings, subrings, invertibility, divisors of zero, and equivalence relations in formal fractions.

Explores Gaussian integers, prime factorization, and number theory concepts related to prime numbers.

Covers Lenstra's Algorithm for integer factorization, which efficiently computes prime factors of an integer.

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