Bourbaki

Exercise 20, § 1

Algebra, VII, p. 52

\* Let π(x)\pi(x) be the number of primes less than the real number x>0x > 0. For each integer n>0n > 0, show that

nπ(2n)−π(n)≤(2nn)≤(2n)π(2n) n^{\pi(2n) - \pi(n)} \leq \binom{2n}{n} \leq (2n)^{\pi(2n)}
(notice that (2nn)\binom{2n}{n} is a multiple of the product of all the primes q such that n<q≤2nn < q \leq 2n); on the other hand, use Ex. 19 to show that (2nn)\binom{2n}{n} divides the product ∏pr(p)\prod p^{r(p)}, where p runs through the set of prime numbers ≤2n\leq 2n, and where r(p)r(p) is the largest integer such that pr(p)≤2np^{r(p)} \leq 2n. Deduce from this result that there exist two real numbers a and b such that 0<a<b0 < a < b and
an(log⁡n)−1≤π(n)≤bn(log⁡n)−1 an(\log n)^{-1} \leq \pi(n) \leq bn(\log n)^{-1}
(notice that 22n(2n+1)1≤(2n)!/(n!)−2≤2′′′2^{2n}(2n + 1)^1 \leq (2n)!/(n!)^{-2} \leq 2''').

1 It has been shown that π(x)∼xlog⁡x\pi(x) \sim \frac{x}{\log x} as x tends to +∞+ \infty (cf. for example A. E. Ingham, The distribution of prime numbers (Cambridge tracts, No. 30), Cambridge University Press, 1932).

EXERCISES

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.