Lectures related to Computational number theory

Explores multicorrelation sequences, primes, and their intricate connections in number theory and ergodic theory.

Fermat's Little Theorem: Applications and Probabilities

Explores Fermat's Little Theorem applications and probabilities in primality testing.

Covers groups, rings, number theory, atomic bonds, and materials structure, setting the foundation for further exploration.

Rudiments of Number Theory

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

Number Theory: Congruence

Explains congruence modulo m and its applications in arithmetic operations.

Fermat's Little Theorem

Explores Fermat's Little Theorem, its extensions, primality testing algorithms, and the significance of prime numbers in cryptography.

Number Theory: More Facts about Primes

Covers the distribution of primes, arithmetic progressions, Mersene primes, and Goldbach's Conjecture.

Primes in Arithmetic Progression

Explores primes in arithmetic progression, focusing on L-functions, characters, and the divergence of the sum of 1 over p for p congruent to a modulo q.

Number Theory: Fundamental Concepts

Covers binary addition, prime numbers, and the sieve of Eratosthenes in number theory.

Complex Numbers: Gauss Numbers

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

Applications of Ergodic Theory to Combinatorics

Explores the applications of ergodic theory to combinatorics and number theory, including Szemerédi's Theorem and the Erdős-Kac Theorem.

Primes and Coprime

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

Integers: Well Ordering and Induction

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

Shor's Factoring Algorithm

Covers Shor's factoring algorithm, aiming to find integer factors efficiently using quantum computation.

Integer Factorization: Methods and Algorithms

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

Arithmetic Functions: Multiplicative Functions and Dirichlet Convolution

Covers multiplicative functions, Dirichlet convolution, and the Mobius function in arithmetic functions.

Number Theory: Foundations and Applications in Cryptography

Introduces number theory and its essential applications in cryptography.

Understanding Equivalence Relations and Integer Construction

Covers the construction of integers through equivalence relations and their properties in mathematics.