[GDKOI2016] 小学生数学题

Description

求$\sum_{i=1}^n \frac{1}{i} \bmod p^k$。

Constraint

$p \le 10^5$
$p^k \cdot n \le 10^{18}$

Analysis

首先，给出一条性质

$$\begin{equation} \begin{aligned} a &\equiv b \pmod p \\ \Leftrightarrow ac &\equiv bc \pmod {pc} \end{aligned} \end{equation}$$

具体证明非常简单，只要考虑到

$$\begin{equation*} \begin{aligned} a &= kp + b \\ ac &= k(pc) + (bc) \end{aligned} \end{equation*}$$

那用处就是

$$\begin{equation} \begin{aligned} &a \bmod p = b \\ &ac \bmod pc = bc = (a \bmod p)c \end{aligned} \end{equation}$$

那这道题我们借鉴计算阶乘时的思想，提取出$p$整除的数。

$$\begin{equation*} \begin{aligned} Solve(n, k) &= \sum_{i=1}^n \frac{1}{i} \bmod {p^k} \\ &= \left( \frac{1}{p} \sum_{i=1}^{\left \lfloor \frac{n}{p} \right \rfloor} \frac{1}{i} + \sum_{0<a<p}^{a+bp\le n} \frac{1}{a+bp} \right) \bmod p^k \end{aligned} \end{equation*}$$

然后我们分开考虑这两部分，先考虑第一部分，利用上性质(1)(2)，可以得到

$$\begin{equation*} \begin{aligned} \frac{1}{p} \sum_{i=1}^{\left \lfloor \frac{n}{p} \right \rfloor} \frac{1}{i} \bmod p^k &= \frac{1}{p} \sum_{i=1}^{\left \lfloor \frac{n}{p} \right \rfloor} \frac{1}{i} \bmod p^{k} \\ &= \left( \frac{\sum \frac{1}{i}}{p} \bmod p^k \right) \cdot \frac{p}{p} \\ &= \left ( p \left( \frac{\sum \frac{1}{i}}{p} \bmod p^k \right) \right ) \cdot \frac{1}{p} \\ &= \left( \sum \frac{1}{i} \bmod p^{k+1} \right) \cdot \frac{1}{p} \\ &= Solve\left(\left \lfloor \frac{n}{p} \right \rfloor, k+1 \right) \cdot \frac{1}{p} \end{aligned} \end{equation*}$$

递归求解即可，现在考虑第二部分

$$\begin{equation*} \begin{aligned} \sum_{0<a<p}^{a+bp\le n} \frac{1}{a+bp} &= \sum_{a=1}^{p-1} \sum_{b=0}^{\left \lfloor \frac{n-a}{p} \right \rfloor} \frac{1}{a+bp} \\ &= \sum_{a=1}^{p-1} \sum_{b=0}^{\left \lfloor \frac{n-a}{p} \right \rfloor} \frac{1}{1+\frac{bp}{a}}\cdot \frac{1}{a} \\ &= \sum_{a=1}^{p-1} \frac{1}{a} \sum_{b=0} ^{\left \lfloor \frac{n-a}{p} \right \rfloor} \frac{1}{1-(-\frac{bp}{a})} \\ &= \sum_{a=1}^{p-1} \frac{1}{a} \sum_{b=0} ^{\left \lfloor \frac{n-a}{p} \right \rfloor} \sum_{i=0}^{\infty} \left(-\frac{bp}{a} \right)^i \\ &= \sum_{a=1}^{p-1} \frac{1}{a} \sum_{b=0} ^{\left \lfloor \frac{n-a}{p} \right \rfloor} \sum_{i=0}^{\infty} \left(-\frac{p}{a} \right)^i \cdot b^i \\ &= \sum_{a=1}^{p-1} \frac{1}{a} \sum_{i=0}^{k-1} \left(-\frac{p}{a} \right)^i \sum_{b=0} ^{\left \lfloor \frac{n-a}{p} \right \rfloor} b^i \end{aligned} \end{equation*}$$

这里就是自然数幂求和，用$\left [ 2k\times 2k \right]$的矩阵，
一次求出所有$i$的$S_i$。

时间复杂度：$T(n,k) = T(\frac{n}{p},k+1) + k^3 + kp = (k^3+kp) \log_p^n$。