Search Problems   RSS Feed
projecteuler.net

Factorials Divisible by a Huge Integer

 Published on Saturday, 15th January 2011, 10:00 pm and solved by 1294
Difficulty: Level 15 [39%]

Problem 320

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}$.



Copied to Clipboard