values of the prime counting function and estimates for selected inputs

In illustrating the degree of error of various estimates of the prime counting function given in connection to the prime number theorem, it is customary to select powers of 10 as the inputs. These are given in the table below, mixed in with primes beginning and ending prime gaps, the fourth primes of selected prime quadruplets and selected record lows of the Mertens function. The values of the logarithmic integral and the division of $n$ by its natural logarithm have been rounded off to the nearest integer.

The smaller values (up to $n=2000$ ) have been verified by hand. Above that, I have trusted Mathematica 4.2 completely.

单词	ValuesOfThePrimeCountingFunctionAndEstimatesForSelectedInputs
释义	values of the prime counting function and estimates for selected inputs In illustrating the degree of error of various estimates of the prime counting function given in connection to the prime number theorem, it is customary to select powers of 10 as the inputs. These are given in the table below, mixed in with primes beginning and ending prime gaps, the fourth primes of selected prime quadruplets and selected record lows of the Mertens function. The values of the logarithmic integral and the division of $n$ by its natural logarithm have been rounded off to the nearest integer. The smaller values (up to $n=2000$ ) have been verified by hand. Above that, I have trusted Mathematica 4.2 completely.
随便看	flat morphism FlatResolution flat resolution FleurysAlgorithm Fleury’s algorithm FlexibleAlgebra flexible algebra Flow flow flow Flow1 FloydsAlgorithm Floyd’s algorithm FluxOfVectorField flux of vector field FodorsLemma Fodor’s lemma Forcing forcing ForcingRelation forcing relation ForcingsAreEquivalentIfOneIsDenseInTheOther forcings are equivalent if one is dense in the other FormalCongruence formal congruence