Covers the analysis of arithmetic functions, including prime numbers and the Riemann hypothesis.
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.
Explores Fermat's Little Theorem, its extensions, primality testing algorithms, and the significance of prime numbers in cryptography.
Explores the Chinese Remainders Theorem, RSA public-key cryptosystem, bijective properties, and key generation for encryption and decryption.
