j
k
j a
j l
At 07:05 AM 1/21/2004, you wrote:
Is this true? for any e>0, n^e>pi(n) for all n>N_e where pi(n) is the number of primes <=n
Is this true?
for any e>0, n^e>pi(n) for all n>N_e
where pi(n) is the number of primes <=n
Yes, n^e grows much faster than pi(n).
Back to the thread
Back to the list
