Modular Arithmetic: Foundations and Applications

Related lectures (24)

Page 1 of 3

Covers commutative groups and their significance in cryptography.

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

Explores modular arithmetic, emphasizing inverses and equations in Z/mZ, with practical examples and exercises.

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

Introduces number theory and its essential applications in cryptography.

Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.

Explores the proof of the Prime Number Theorem and its implications in number theory.

Explores the Euclidean algorithm, Bézout's identity, extended Euclid algorithm, and commutative groups in mathematics.

Covers the Fourier inversion formula, exploring its mathematical concepts and applications, emphasizing the importance of understanding the sign.

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