Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2019/iii/paper-150/2/a/solution

Let be a finite nonnegative sequence, let be a set of prime numbers, and define
The sifting function is
For a finite set of integers, take to be the number of occurrences of in ; then counts members divisible by no below . For , write

New to topics? Read the docs here!