# CMO 2018 Problem 2

##### Define a function \(f(n)\) from the positive integers to the positive integers such that \(f((f(n))\) is the number of positive integer divisors of \(n\). Prove that if \(p\) is a prime, then \(f(p)\) is prime.

**Write the problem neatly in mathematical terms.** The first step is that only.

If you have any alternate solution or approach, we would love to hear it from you. The comments’ section is handed over to you.

Hi