Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/ii/paper-4/11g/d/solution

Every prime in is at least . Consequently the primorial satisfies
Combining this with part (c) and taking logarithms gives
so
For , the inequality implies
Thus the prime-counting upper bound from a primorial estimate yields
We may take .

New to topics? Read the docs here!