Lectures related to Algebraic number theory

Covers GCD, LCM, and the Euclidean algorithm for efficient computation.

Explains the importance of parentheses in simplifying mathematical operations and notations.

Covers the advanced counting topic of distinct n-duples of integers.

Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.

Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.

Explores Gaussian integers, prime factorization, and number theory concepts related to prime numbers.

Covers addition properties and operations in the set of integers Z.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

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

Covers the properties of subtraction and the distributivity of multiplication.