Euler in Babylon

Factorials divisible by a huge integer

January 15, 2011

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

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

S(1000)=614538266565663.

Find S(1 000 000) mod 1018.


gamwe6

Written by gamwe6 who lives and works in San Francisco building useful things. You should follow him on Twitter