Lectures related to Prime Numbers and Algorithms

Covers the concept of algorithms, loop invariants, and examples of algorithmic problem-solving.

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

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

Covers commutative groups and their significance in cryptography.

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.

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

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