洛谷P1829 [国家集训队]Crash的数字表格 / JZPTAB (莫比乌斯反演+数论分块+线性筛)
题目链接:https://www.luogu.com.cn/problem/P1829
题目大意:给定一组 n , m n,m n,m ,求 ∑ i = 1 n ∑ j = 1 m l c m ( i , j ) m o d 20101009 \sum\limits_{i=1}^n\sum\limits_{j=1}^mlcm(i,j) \space mod\space 20101009 i=1∑nj=1∑mlcm(i,j) mod 20101009 的值。
题解:直接上推导式子的过程。根据数论函数求和的题目的一些套路,我们可以尝试把原式转化为可以应用数论分块的求和式,从而降低求和的时间复杂度。不妨先设 n ≤ m n\le m n≤m 。
原式: ∑ i = 1 n ∑ j = 1 m l c m ( i , j ) \sum\limits_{i=1}^n\sum\limits_{j=1}^mlcm(i,j) i=1∑nj=1∑mlcm(i,j)
= ∑ i = 1 n ∑ j = 1 m i j g c d ( i , j ) =\sum\limits_{i=1}^n\sum\limits_{j=1}^m\frac{ij}{gcd(i,j)} =i=1∑nj=1∑mgcd(i,j)ij
= ∑ i = 1 n ∑ j = 1 m ∑ d = 1 n i j d [ g c d ( i , j ) = d ] =\sum\limits_{i=1}^n\sum\limits_{j=1}^m\sum\limits_{d=1}^n\frac{ij}{d}[gcd(i,j)=d] =i=1∑nj=1∑md=1∑ndij[gcd(i,j)=d]
= ∑ d = 1 n ∑ i = 1 n ∑ j = 1 m i j d [ g c d ( i , j ) = d ] =\sum\limits_{d=1}^n\sum\limits_{i=1}^n\sum\limits_{j=1}^m\frac{ij}{d}[gcd(i,j)=d] =