Number Theory: Division, Remainder, Congruence

Related lectures (28)

Page 2 of 3

Introduces number theory and its essential applications in cryptography.

Explores well ordering, induction, Euclidean division, and prime factorization in integers.

Introduces deterministic approaches to identify prime numbers and covers algorithms and modular arithmetic for prime number testing.

Covers prime numbers, primality testing algorithms, modular arithmetic, and efficient exponentiation methods.

Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.

Explores optimizing exponentiation in modular arithmetic for efficient calculations and prime number determination.

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

Covers the definition of a function to determine if a given number is prime.

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

Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.