If $f$ is from positive integers to positive integers and satisfies
$f(m f(n)) = n f(m)$ then find the minimum possible value of $f(2007)$.
My work so far:
- $f(1) = 1$ . Proof:
Suppose $f(1) = k \neq 1$. Then consider $f(f(2)) = 2f(1) = 2k$. $f(2) = f(2f(1)) = f(2k),$ $f(f(2)) = 2k,$ but the above also implies that $f(f(2)) = f(f(2k)) = 2k^2$, a contradiction. Thus $f(1) = 1$
- I further found that if $f(a) = b$, then $f(a^x b^y) = a^y b^x$.
Let $a=f(1)\neq 0$.
If we put $n=f(k)$ we get $f(mk)=f(k)f(m)$ so $f$ is multiplicative. Each such function is uniqely determined by the pictures of primes. We have $$f(2007) = f(3)^2f(223)$$
$f(3)=p$ and $f(223)=q$ are primes. Since $$f(p)=f(f(3))=3$$ and $$f(q)=f(f(223))=223$$ the minimum will be if we take $p=3$ and $q=2$. so the answer is $18$?