Lectures related to Number Theory: Congruence

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

Covers congruence modulo m and arithmetic operations.

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

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

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

Covers binary representation, two's complement, overflow detection, and operations in MIPS for computer arithmetic with integers.

Introduces modular arithmetic, its properties, and applications in cryptography and coding theory.

Covers the rules of calculation for powers, roots, and more, focusing on positive numbers and integers.

Covers binary addition, prime numbers, and the sieve of Eratosthenes in number theory.

Introduces number theory and its essential applications in cryptography.

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

Introduces Z/mZ for writing equations with congruence classes in modular arithmetic.

Covers number theory, division, remainder, congruence, prime numbers, integer representation, and the Euclidean algorithm.

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

Covers Barrett reduction, Montgomery form of integers, and efficient Montgomery product computation.

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

Covers basic properties of natural numbers, including order relations and inverses.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers the representation of integers using different bases and the conversion between them.

Covers the definition of primes, the Fundamental Theorem of Arithmetic, and Euclid's Theorem.