Lectures related to Primes and Coprime

Covers function composition and integers, including properties and examples.

Introduces modulo arithmetic, Euclid's algorithm, and congruence in number theory.

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

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

Explores natural numbers, their properties, operations, and practical applications like calculating hours in a year.

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

Explores prime numbers, modular arithmetic, Wilson's theorem, and complexity analysis.

Explores methods and algorithms for integer factorization, including testing for B smoothness and computing small primes.