Problem Archive

Let $N(i)$ be the smallest integer $n$ such that $n!$ is divisible by $(i!)^{1234567890}$

Let $S(u)=\sum N(i)$ for $10 \le i \le u$.

$S(1000)=614538266565663$.

Find $S(1\,000\,000) \bmod 10^{18}$.

Solution
No solution yet. Write yours at solutions/s320.md.
Problems sourced from Project Euler · Non-commercial & educational use only · CC BY-NC-SA 4.0