This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Factorials divisible by a huge integer

Problem 320

Published on 15 January 2011 at 10:00 pm [Server Time]

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

Let S(u)=∑N(i) for 10 ≤ i ≤ u.

S(1000)=614538266565663.

Find S(1 000 000) mod 1018.


Answer:
Go to back to Problems