This lecture introduces elementary number theory, focusing on primes, congruences, and key theorems. It covers methods for finding primes, including the sieve of Eratosthenes, and discusses the infinite nature of primes as established by Euclid. Additionally, it explores Mercenne and Fermat primes, algorithms, and the complexities of Diophantine equations.