Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2023/discrete-mathematics-probability-and-continuous-mathematics/3/c/solution

The allowed primes are exactly . Define
The fundamental theorem of arithmetic makes this definition unambiguous and proves injectivity. For every , the positive integer belongs to and maps to that tuple, proving surjectivity. The inverse function is explicitly . In particular, maps to . This is the prime-exponent parametrization of smooth numbers.

New to topics? Read the docs here!