Past exam of the mathematics course of the University of Cambridge 2005 ii Paper 3 1H Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2007 ii Paper 4 1F Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 2 1G Solution Created 2026-09-24 Updated 2026-10-05
The Legendre prime-counting formula counts positive integers surviving a finite prime sieve. For , put and let be the primes at most . By inclusion-exclusion principle, the number of positive integers at most divisible by none of these primes isThe empty product is . Every composite number at most has a prime factor at most , so the survivors are precisely and the primes between and . ConsequentlyFor , the sieving primes are , andAs a direct check, the primes are .