[国家集训队] Crash的数字表格/JZPTAB(莫比乌斯反演)

[国家集训队] Crash的数字表格/JZPTAB

Statement

计算: $Ans={\sum }_{i=1}^N{\sum }_{j=1}^M\text{lcm}(i,j)$.

Solution

${\sum }_{i=1}^N{\sum }_{j=1}^M\text{lcm}(i,j)={\sum }_{i=1}^N{\sum }_{j=1}^M\frac{i\cdot j}{\gcd (i,j)}$.

• $Ans={\sum }_{d=1}^{min(N,M)}\frac{1}{d}{\sum }_{i=1}^N{\sum }_{j=1}^{M}i\cdot j[\gcd (i,j)=d]$

设$f(d)={\sum }_{i=1}^N{\sum }_{j=1}^{M}i\cdot j[\gcd (i,j)=d]$.

设$g(d)={\sum }_{d|d^{\prime }}f(d^{\prime })={\sum }_{i=1}^N{\sum }_{j=1}^{M}i\cdot j[d|\gcd (i,j)]={\sum }_{i=1}^N{\sum }_{j=1}^{M}i\cdot j[d|i][d|j]$.

则$g(d)={\sum }_{i=1}^{N}i[d|i]{\sum }_{j=1}^{M}j[d|j]=[d\frac{(1+\lfloor \frac{N}{d}\rfloor )\lfloor \frac{N}{d}\rfloor }{2}]\times [d\frac{(1+\lfloor \frac{M}{d}\rfloor )(\lfloor \frac{M}{d}\rfloor )}{2}]$.

则$f(d)={\sum }_{d|d^{\prime }}\mu (\frac{d^{\prime }}{d})g(d^{\prime })={\sum }_{d|d^{\prime }}\mu (\frac{d^{\prime }}{d})\cdot d^{\prime 2}\cdot [\frac{(1+\lfloor \frac{N}{d}\rfloor )\lfloor \frac{N}{d}\rfloor }{2}]\times [\frac{(1+\lfloor \frac{M}{d}\rfloor )(\lfloor \frac{M}{d}\rfloor )}{2}]$.

不妨设$g(n,m)=\frac{(1+n)n}{2}\times \frac{(1+m)m}{2}$.

整理可得:
$$\begin{array}{rl}Ans& =\sum _{d=1}^{\min (N,M)}\frac{1}{d}f(d)\\ & =\sum _{d=1}^{\min (N,M)}\frac{1}{d}\sum _{d|d^{\prime }}\mu (\frac{d^{\prime }}{d})\cdot d^{\prime 2}\cdot g(\lfloor \frac{N}{d^{\prime }}\rfloor ,\lfloor \frac{M}{d^{\prime }}\rfloor )\\ & =\sum _{d=1}^{\min (N,M)}d\sum _{t=1}^{\min (\frac{N}{d},\frac{M}{d})}\mu (t)\cdot t^2\cdot g(\lfloor \frac{N}{td}\rfloor ,\lfloor \frac{M}{td}\rfloor )\end{array}$$
我们不妨设: $Sum(n,m)={\sum }_{i=1}^{\min (n,m)}\mu (i)\cdot i^2\cdot g(\lfloor \frac{n}{i}\rfloor ,\lfloor \frac{m}{i}\rfloor )$.

可得$Ans={\sum }_{d=1}^{\min (N,M)}d\cdot \text{ sum }(\lfloor \frac{N}{d}\rfloor ,\lfloor \frac{M}{d}\rfloor )$.

时间复杂度-二次数论分块: $O(\sqrt{N}\times \sqrt{N})=O(N)$.

Link

[1] [国家集训队]Crash的数字表格/JZPTAB