Re: Inequality sum( log(p) ), p prime



Carl R. wrote:

> Let theta(x)= sum(log(p) over all primes p, p<=x ).
>
> Why is theta(x) <= (log(4))*x ??

You could see many texts on elementary number theory, say Hardy & Wright
or

http://www.maths.ex.ac.uk/~rjc/etc/bertrand.pdf
--
Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html
"Elegance is an algorithm"
Iain M. Banks, _The Algebraist_
.



Relevant Pages

  • Re: Will NIST fix their tables?
    ... Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html ... "Elegance is an algorithm" ... Iain M. Banks, _The Algebraist_ ...
    (sci.math)
  • Re: Proof of ordered powerset
    ... Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html ... "Elegance is an algorithm" ...
    (sci.math)
  • Re: For Fermat fans
    ... >> The first solver wins a copy of the complete works of JSH. ... Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html ... "Elegance is an algorithm" ...
    (sci.math)
  • Re: Help find min poly.
    ... Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html ... "Elegance is an algorithm" ... Iain M. Banks, _The Algebraist_ ...
    (sci.math)
  • Re: Aut H / Inn H
    ... Robin Chapman, www.maths.ex.ac.uk/~rjc/rjc.html ... "Elegance is an algorithm" ... Iain M. Banks, _The Algebraist_ ...
    (sci.math)