DescriptionPrime numbers are the atoms of the integers. Every integer can be uniquely factored into primes. Since the days of Euclid we know that there are infinitely many primes. However, questions like the distribution of primes are mysterious and notoriously difficult. For example, the prime numbers between 9.999.900 and 10.000.000 are 9.999,901, 9.999.907,
9.999.929, 9.999.931, 9.999.937
9.999.943,
9.999.971, 9.999.973, 9.999.991,
whereas between 10.000.000 and 10.000.100 we only have
10.000.019
10.000.079.
However, in 1792, the 15 year old Gauss, while studying tables of logarithm, observed that π(x), the number of prime numbers less or equal a real number x, while `locally' rather randomly, satisfies `globally' a striking smoothness: π(x) ∼ ln(x)/x,
for x large. That is, for large x, the function ln(x)/x approximates π(x) very well. (In fact, Gauss discovered an even better approximation using the so called logarithmic integral Li(x)). This assertion is known as the PRIME NUMBER THEOREM (PNT) and was finally proven more than 100 years later in 1896 independently, by J. Hadamard and C. de la Vallee Poussin. They employed methods of complex analysis. More precisely, they studied the famous Riemann ζ-function, which was introduced by Riemann in his seminal 1859 paper. It is initially defined for a complex variable s with real part Re(s)>1 by the infinite series In this project, we plan to study Riemann Zeta Function and the Prime Number Theorem. In addition, we also consider Dirichlet's Theorem on primes in an arithmetic progression, which initiated analytic number theory in 1837, and also the analytic class number formula for quadratic fields. Prerequisites
|