Past exam of the mathematics course of the University of Cambridge 2025 ii Paper 4 11G c Solution Created 2026-09-24 Updated 2026-10-03
It suffices first to prove the elementary primorial bound for positive integers , by strong induction. The case is immediate.
If , every prime with divides : the numerator contains , whereas the two copies of do not. Since these primes are distinct,The induction hypothesis and the binomial theorem give
Primorial Created 2026-09-24 Updated 2026-11-05
The primorial up to a real bound is the product of all prime numbers not exceeding :For example, , while . Each prime factor occurs once, so a primorial is a squarefree integer. It stays constant between successive primes, and for by the empty product convention.
Its natural logarithm is the Chebyshev theta function, . This converts multiplicative bounds on primorials into additive estimates over primes. In particular, the elementary primorial bound gives for .