Let $D(m,n)=\displaystyle\sum_{d\mid m}\sum_{k=1}^n\sigma_0(kd)$ where $d$ runs through all divisors of $m$ and $\sigma_0(n)$ is the number of divisors of $n$.
You are given $D(3!,10^2)=3398$ and $D(4!,10^6)=268882292$.
Find $D(200!,10^{12}) \bmod (10^9 + 7)$.
Solution
No solution yet. Write yours at
solutions/s608.md.