How string is the statement that π(n) ~ n/log(n)? One certainly imagines it to be strong enough to say something specific about pi(n)-pi(n-1), but this is certainly not the typical Prime Number Theorem people study.
–
Ilya NikokoshevOct 26 '09 at 23:55

If one wants an explicit bound on N0, apparently this can be gleaned from a Ph.D. thesis by Pierre Dusart (in French) which contains the result that for all x > 3275 there is a prime between x and x(1 + 1/(2 ln2 x)). So we can take N0 to be max(3275,exp((2 epsilon)−1/2)).