 
 
 
 
 
   
Can we say something more precise?
Let's consider a similar question:
 ?
?
 and $n$ is a perfect square
    and $n$ is a perfect square  
 and
 and 
 .
.
A better question is:
 are perfect squares, as a function of
 are perfect squares, as a function of  ?
? .
.
So a good question is:
 are prime?
 are prime? primes
 primes  
 
We can compute a few more values of  using PARI:
 using PARI:
? pi(x, c=0) = forprime(p=2,x,c++); c; ? for(n=1,7,print(n*100,"\t",pi(n*100))) 100 25 200 46 300 62 400 78 500 95 600 109 700 125Now draw a graph on the blackboard. It will look like a straight line...
Gauss spent some of his free time counting primes.  By the end
of his life, he had computed  for
 for  up to
 up to  million.
 million.
 
 is asymptotic to
 is asymptotic to  , in the sense that
, in the sense that
   
 
 can be used
to approximate
 can be used
to approximate  , for any
, for any  .  In fact,
.  In fact,  is the best choice.
is the best choice.
? pi(x, c=0) = forprime(p=2,x,c++); c; ? for(n=1,10,print(n*1000,"\t",pi(n*1000),"\t",n*1000/(log(n*1000)-1))) 1000 168 169.2690290604408165186256278 2000 303 302.9888734545463878029800994 3000 430 428.1819317975237043747385740 4000 550 548.3922097278253264133400985 5000 669 665.1418784486502172369455815 6000 783 779.2698885854778626863677374 7000 900 891.3035657223339974352567759 8000 1007 1001.602962794770080754784281 9000 1117 1110.428422963188172310675011 10000 1229 1217.976301461550279200775705
 
 
 
 
