Perhaps the most amazing result yet found concerning the distribution of the primes is so-called prime number theorem. Suppose we let A_n denote the number of primes below n. The prime number theorem then says that (A_n log〖n)/n)〗 approaches l as n becomes larger and larger. In other words A_n/n, called the density of the primes among the first n integers, is approximated by 1/〖log〗_4 n, the approximation improving as n increases. This theorem was conjectured by Gauss from an examination of a large table of primes, and was independently proved in 1896 by the French and Belgian mathematicians J. Hadamard and C.J. de la vallee Poussin.