Sunday, 14 April 2013

number theory - Chebyshev/Tchebycheff's results concerning phi(x).



The book "A SOURCE BOOK IN MATHEMATICS" has a great collection of mathematical papers. On of the is Chebyshev's Memoir on "The Totality of Primes Less Than a Given Number."



The book states that




Chebyshev did not reach the final goal - to prove that the ratio of ϕ(x):xlogx tends to 1 as x.





However, in the Memoir it is presented the following:




Theorem 3. The expression xϕ(x)logx

can not have a limit disinct from 1 as x.



ϕ(x)xlogx1




This a much better estimate. Can't it be used to show:




ϕ(x)xlogx?



Moreover, Chevyshev proves:




Theorem 2. The function ϕ(x) which designates the totality of primes less than x, satisfies infinitely many times, between x=2 and x=, each of the inequalities,



ϕ(x)>x2dxlogxαxlognxϕ(x)<x2dxlogx+αxlognx





Which gives an even better and modern estimate, which has xlogx as a leading term.



Why is it that the statement is given even though his results seem much greater in hierarchy?


Answer



Let π(x) be the usual prime-counting function. The first result that you mention is easly shown to be equivalent to the statement that if
limxπ(x)xlogx


exists, then that limit must be 1. There remained the very hard problem of proving that the limit exists. Although considerable effort was expended on the problem, the final proof only came almost a half-century later.




The second result says that the inequalities are satisfied infinitely many times, meaning that there exist arbitrarily large x for which the inequalities hold. But the second result does not say that the inequalities always hold, or even that they hold for all large enough x.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...