Primes: The First Two Thousand Four Hundred Prime Numbers

摘要

These simple and mathematically elegant but practically useless prime numberlistings could have an appeal for afficionados of elementary number theory. They were prepared using a computer adaptation of the Sieve of Aratosthenes of Alexandria and the computations made on a small personal computer with an 8-bit microprocessor, a 64K random access memory, and a 2-megahertz clock. Computing time for checking 21, 380 integers and identifying the included 2400 prime numbers was about thirty minutes. This computational effort is quite modest compared to others such as two which are reported to have examined the first ten million integers. But the mere 2400 primes reported here, plus related items such as the number of prime twins and the integer gap between successive primes, are presented in tangible form.