Re: On using Prime Counting Function in proofs


Gerry Myerson wrote:
> In article <1128209425.300282.86040@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
> "Joubin Houshyar" <Sun_of_27@xxxxxxxxx> wrote:
>
> > If the proof is trying to establish a minimum bound for a certain
> > function X(n), and 'undercounting' Pi(n) is acceptable (in the proof*)
> > is the simple "pi(n) > n/ln(n)" acceptable as a correct approximation
> > for pi(n)?
>
> Do you know for a fact that pi(n) > n / (log n) for all n?


http://mathworld.wolfram.com/PrimeCountingFunction.html

"[...] for n>=17 (Rosser and Schoenfeld 1962) [...]"


> --
> Gerry Myerson (gerry@xxxxxxxxxxxxxxx) (i -> u for email)

.