Prove that $f(n)=n$, $\forall n \in \mathbb N$ for the strictly increasing multiplicative function
Let $(a_n)$ be a strictly increasing sequence of positive integers such that: $a_2 = 2$, $a_{mn} = a_m a_n$ for $m, n$ relatively prime.