Number Theory: History and Concepts

Related lectures (28)

Page 1 of 3

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

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

Introduces number theory and its essential applications in cryptography.

Introduces sets, maps, divisors, prime numbers, and arithmetic principles related to integers.

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

Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.

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

Explores Fermat's Little Theorem, its extensions, primality testing algorithms, and the significance of prime numbers in cryptography.

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

Explores prime numbers and Euclid's Theorem through a proof by contradiction.