In which we gain some further insight into the distribution of the primes.
- Proposition 52 (Legendre‘s formula): For , we have . We saw that this follows nicely from the inclusion-exclusion principle.
- Lemma 53: For any natural number , we have . These are both easy bounds arising from the expansion of or from counting subsets of .
Lemma 54: For any , we have . We proved this for natural numbers using induction.
- Theorem 55 (Bertrand‘s postulate): For any natural number , there is a prime with . Our strategy was to show that the product is strictly bigger than 1. We noticed that this product divides the binomial coefficient , and found an upper bound for the remainder of the contribution. Next time we’ll finish studying this upper bound in order to obtain the lower bound on that we wanted. In the meantime, I encourage you to try to finish the proof for yourself.
Erdős and Surányi (Topics in the theory of numbers) discuss Bertrand’s postulate and a number of other interesting results relating to the distribution of the primes. There’s also a proof of Bertrand’s postulate in Hardy and Wright (An Introduction to the Theory of Numbers).
Preparation for Lecture 18
Of course, you should try to finish the proof of Bertrand’s postulate for yourself.
Then next time we’ll have another change of topic. We’re going to think about approximating irrational numbers by rationals (Diophantine approximation). The aim is to get a very good approximation by a rational with very small denominator. How would you go about finding a good rational approximation to or , for example? If you find a good approximation, can you be confident that it’s the best option? (That is, could there be another rational with smaller denominator that gives a better approximation?)