Lectures related to Euclidean Algorithm: GCD Calculation

Covers counting distinct elements using hash functions and the median trick.

Explores algorithmic complexity, visualization of functions, and algorithm efficiency analysis using Python.

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Covers Lenstra's Algorithm for integer factorization, which efficiently computes prime factors of an integer.

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

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

Explores methods and algorithms for integer factorization, including testing for B smoothness and computing small primes.