[AccessD] Weekend fun: Primes

Stuart McLachlan stuart at lexacorp.com.pg
Fri Dec 16 07:23:54 CST 2005


On 16 Dec 2005 at 2:53, Arthur Fuller wrote:

> LOL, Gustav! No, I meant the largest unknown prime.
> 
http://primes.utm.edu/infinity.shtml
<quote>
About 2000 years ago Euclid proved that there were infinitely many primes. 
For mathematicians "infinity many" is an incomplete answer--they then ask 
"how big of an infinity?"  The prime number theorem, which states the 
number of primes less than x is approximately x/log x (the natural log), 
gives perhaps the best answer. 
......
the sum of the reciprocals of the primes diverges, so the primes are a 
"large" subset of the integers
</quote>
-- 
Stuart





More information about the AccessD mailing list