乘性函数个人题解

$1.求所有满足\sigma (n)+\varphi (n)=2n$

解:
设$n=p_1^{a_1}{p}_2^{a_2}...p_t^{a_t}$

$\sigma (n)+\varphi (n)$

$={\prod }_{k=1}^t(1+p_k+p_k^2+...+p_k^{a_k})+{\prod }_{k=1}^t(p_k^{a_k}-p_k^{a_k-1})$

$\because$ 其中第二项里的负项，必在第一项里可以找到相应的正项

$\therefore \sigma (n)+\varphi (n)\ge 2n$

$\because$ 当不同素数因子多于$1$或者幂数大于$1$则 $\sigma (n)+\varphi (n)>2n$

$\therefore prime(n)=True$

$\sigma (p)+\varphi (p)=(1+p)=(p-1)=2p$

$2.$证明: 不存在两个正整数具有相同的因子之积.

证:

$n=p_1^{a_1}{p}_2^{a_2}...p_t^{a_t},m=p_1^{b_1}{p}_2^{b_2}...p_t^{b_t}$

$f(n)={\prod }_{d|n}d$

设$a,b\in Z_{+},(a,b)=1$

$f(ab)={\prod }_{d|ab}d={\prod }_{d_1|a,d_2|b}{d}_1{d}_2$

$={\prod }_{d_1|a}(d_1^{\tau (b)}{\prod }_{d_2|b}{d}_2)$

$=f(a{)}^{\tau (b)}f(b{)}^{\tau (a)}$

又

$\because f(n=p^t)={\prod }_{i=0}^t{p}^i=p^{\frac{t(t+1)}{2}}=n^{\frac{\tau (n)}{2}}$

$\therefore f(n=p_1^{a_1}{p}_2^{a_2})$

$=f(p_1^{a_1}{)}^{\tau (p_2^{a_2})}f(p_2^{a_2}{)}^{\tau (p_1^{a_1})}$

$=p_1^{a_1\frac{\tau (p_1^{a_1})}{2}\tau (p_2^{a_2})}{p}_2^{a_2\frac{\tau (p_2^{a_2})}{2}\tau (p_1^{a_1})}$

$=(p_1^{a_1}{p}_2^{a_2}{)}^{\frac{\tau (p_1^{a_1})\tau (p_2^{a_2})}{2}}$

$=n^{\frac{\tau (n)}{2}}$

猜想：$f(n)={\prod }_{d|n}d=n^{\frac{\tau (n)}{2}}$

基础步骤
$n=1,2\Rightarrow f(n)=n^{\frac{\tau (n)}{2}}$

归纳步骤

$t\le k,k\in Z_{+}\Rightarrow f(n)=n^{\frac{\tau (n)}{2}}$

$f(n,t=k+1)=f(p_1^{a_1}{p}_2^{a_2}...p_k^{a_k}{p}_{k+1}^{a_{k+1}})$

$=f((p_1^{a_1}{p}_2^{a_2}...p_k^{a_k})p_{k+1}^{a_{k+1}})$

$=f(p_1^{a_1}{p}_2^{a_2}...p_k^{a_k}{)}^{\tau (p_{k+1}^{a_{k+1}})}f(p_{k+1}^{a_{k+1}}{)}^{\tau (p_1^{a_1}{p}_2^{a_2}...p_k^{a_k})}$

$=(p_1^{a_1}{p}_2^{a_2}...p_k^{a_k}{)}^{\frac{\tau (p_1^{a_1}{p}_2^{a_2}...p_k^{a_k})\tau (p_{k+1}^{a_{k+1}})}{2}}(p_{k+1}^{a_{k+1}}{)}^{\tau (p_1^{a_1}{p}_2^{a_2}...p_k^{a_k})\tau (p_{k+1}^{a_{k+1}})}$

$=(p_1^{a_1}{p}_2^{a_2}...p_k^{a_k}{)}^{\frac{\tau (n)}{2}}(p_{k+1}^{a_{k+1}}{)}^{\frac{\tau (n)}{2}}$

$=n^{\frac{\tau (n)}{2}}$

若$a_1=b_1,...,a_k<b_k$，即最先在$k\in [1,t]$位置不等，不失一般性，设$a_k<b_k$

$\therefore p_k^{\frac{a_k\tau (n)}{2}}=p_k^{\frac{b_k\tau (m)}{2}}$

$\therefore a_k\tau (n)=b_k\tau (m)$

$\because a_k<b_k$

$\therefore \tau (n)>\tau (m)$，式$\alpha$

对于$i\ne k$，同样有$a_i\tau (n)=b_i\tau (m)\to a_i<b_i$

$\therefore k=1$，且${\forall }_{i\in [1,t]}{a}_i<b_i$

$\therefore \tau (n)<\tau (m)$，与上面的式$\alpha$矛盾，因此

${\forall }_{i\in [1,t]}{a}_i=b_i$

$\therefore n=m$