Rudiments of Number Theory

Related lectures (23)

Page 1 of 3

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

Introduces number theory and its essential applications in cryptography.

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

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

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

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

Explains congruence modulo m and its applications in arithmetic operations.

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

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

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