Number Theory: Division

Related lectures (26)

Page 1 of 3

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

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

Explains the Euclidean algorithm for polynomials over a field K, illustrating its application with examples.

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

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

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

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

Introduces number theory and its essential applications in cryptography.

Introduces polynomial factorization over finite fields and efficient computation of greatest common divisors of polynomials.

Explores Euclidean division for polynomials, emphasizing uniqueness of quotient and remainder.