The function
![f](/media/m/9/9/8/99891073047c7d6941fc8c6a39a75cf2.png)
from the set
![\mathbb{N}](/media/m/6/0/7/607ae4ca194aaec986c3e218df0f3079.png)
of positive integers into itself is defined by the equality
![\displaystyle f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}](/media/m/c/7/1/c71850654bf621b324ad7278441c5963.png)
a) Prove that
![f(mn)=f(m)f(n)](/media/m/7/f/c/7fc90e3ec4e8cc2a9ff3becb477375db.png)
for every two relatively prime
![{m,n\in\mathbb{N}}](/media/m/b/a/a/baa2a16d665cb5832aa59de08a8c157f.png)
.
b) Prove that for each
![a\in\mathbb{N}](/media/m/a/a/5/aa597c7c2996b3baa25a36d287d550ce.png)
the equation
![f(x)=ax](/media/m/4/e/7/4e7b62ab87445d189fb2c5913d718028.png)
has a solution.
c) Find all
![a \in \mathbb{N}](/media/m/7/0/6/706ebca643f2e69c901d762194028066.png)
such that the equation
![f(x)=ax](/media/m/4/e/7/4e7b62ab87445d189fb2c5913d718028.png)
has a unique solution.
%V0
The function $f$ from the set $\mathbb{N}$ of positive integers into itself is defined by the equality
$$\displaystyle f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}$$
a) Prove that $f(mn)=f(m)f(n)$ for every two relatively prime ${m,n\in\mathbb{N}}$.
b) Prove that for each $a\in\mathbb{N}$ the equation $f(x)=ax$ has a solution.
c) Find all $a \in \mathbb{N}$ such that the equation $f(x)=ax$ has a unique solution.