Number Theory: Modular Arithmetic

Related lectures (27)

Page 1 of 3

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

Introduces number theory and its essential applications in cryptography.

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

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

Explores modular arithmetic and its role in the RSA cryptosystem for error detection.

Explores quotients of groups by equivalence relations and the conditions for well-defined sets.

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

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

Covers commutative groups and their significance in cryptography.

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