Maths Olympiad Prep

Track / Stage 6 / 352 of 400 #1352 of 1964

Problem 1352

National olympiad, first round
Number theory Difficulty 6.8 Prove it

14. Let n>0n>0 be an integer, prove:
(i) n=dnφ(d)n=\sum_{d \mid n} \varphi(d).
(ii) φ(n)=ndnμ(d)d\varphi(n)=n \sum_{d \mid n} \frac{\mu(d)}{d}

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

14. Let n=p1a1p2a2pkakn=p_{1}^{a_{1}} p_{2}^{a_{2}} \cdots p_{k}^{a_{k}}.
(i) Proof:
dipsαsφ(d)=φ(1)+φ(ps)+φ(ps2)++φ(psas)=1+(ps1)+(ps2ps)++(psαspsαs1)=psαs\begin{aligned} \sum_{d i p_{s}^{\alpha_{s}}} \varphi(d)= & \varphi(1)+\varphi\left(p_{s}\right)+\varphi\left(p_{s}^{2}\right)+\cdots+\varphi\left(p_{s}^{a_{s}}\right) \\ = & 1+\left(p_{s}-1\right)+\left(p_{s}^{2}-p_{s}\right)+\cdots \\ & +\left(p_{s}^{\alpha_{s}}-p_{s}^{\alpha_{s}-1}\right)=p_{s}^{\alpha_{s}} \end{aligned}

Therefore \square
dnφ(d)=d1p1ardkpbakφ(d1dk)=d1p1α1φ(d!)d2p2a2φ(d2)dkpkakφ(dk)=p1a1p2a2pkαk=n.\begin{aligned} \sum_{d \mid n} \varphi(d) & =\sum_{d_{1} \mid p_{1}^{a_{r}}} \cdots \sum_{d_{k} \mid p_{b}^{a_{k}}} \varphi\left(d_{1} \cdots d_{k}\right) \\ & =\sum_{d_{1} \mid p_{1}^{\alpha_{1}}} \varphi(d!) \sum_{d_{2} \mid p_{2}^{a_{2}}} \varphi\left(d_{2}\right) \cdots \sum_{d_{k} \mid p_{k}^{a_{k}}} \varphi\left(d_{k}\right) \\ & =p_{1}^{a_{1}} p_{2}^{a_{2}} \cdots p_{k}^{\alpha_{k}}=n . \end{aligned}
(ii) Proof: In the previous problem, take f(d)=φ(d),F(n)=nf(d)=\varphi(d), F(n)=n, then the conclusion of the previous problem and part (i) of this problem together provide the proof.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.