Difference between revisions of "Chebyshev theta function"
m (→Estimates of the function: I didn't know if the slight refinement was due to Chebyshev) |
Missionary (talk | contribs) |
||
Line 2: | Line 2: | ||
<math>\theta</math>, is a function of use in [[analytic number theory]]. | <math>\theta</math>, is a function of use in [[analytic number theory]]. | ||
It is defined thus, for real <math>x</math>: | It is defined thus, for real <math>x</math>: | ||
− | <cmath> \vartheta(x) = \sum_{p \le x} \log | + | <cmath> \vartheta(x) = \sum_{p \le x} \log p , </cmath> |
where the sum ranges over all [[prime number | primes]] less than | where the sum ranges over all [[prime number | primes]] less than | ||
<math>x</math>. | <math>x</math>. | ||
Line 28: | Line 28: | ||
<cmath> x \log 2 \ge \sum_{\lfloor n/2 \rfloor < p \le n} \log p | <cmath> x \log 2 \ge \sum_{\lfloor n/2 \rfloor < p \le n} \log p | ||
= \vartheta{x} - \vartheta{\lfloor n/2 \rfloor} | = \vartheta{x} - \vartheta{\lfloor n/2 \rfloor} | ||
− | \ge \vartheta{x} - 2\lfloor n/2 \rfloor \log 2 \ge \vartheta{x} - x \log | + | \ge \vartheta{x} - 2\lfloor n/2 \rfloor \log 2 \ge \vartheta{x} - x \log 2 , </cmath> |
by inductive hypothesis. Therefore | by inductive hypothesis. Therefore | ||
<cmath> 2x \log 2 \ge \vartheta(x), </cmath> | <cmath> 2x \log 2 \ge \vartheta(x), </cmath> |
Revision as of 19:56, 18 September 2012
Chebyshev's theta function, denoted or sometimes
, is a function of use in analytic number theory.
It is defined thus, for real
:
where the sum ranges over all primes less than
.
Estimates of the function
The function is asymptotically equivalent to
(the prime counting function) and
. This result
is the Prime Number Theorem, and all known proofs are rather
involved.
However, we can obtain a simpler bound on .
Theorem (Chebyshev). If , then
.
Proof. We induct on . For our base
cases, we note that for
, we have
.
Now suppose that . Let
. Then
so
by inductive hypothesis. Therefore
as desired.