Problem 320: Factorials divisible by a huge integer
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.
Test
{{test}}Console output
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.
Use Cmd instead of Ctrl if you're on a Mac.
g | Focus editor |
Ctrl-Enter | Run the test with current code |
Ctrl-Shift-K | Reset the editor |
Ctrl-Shift-L | Clear console output |
Ctrl-Shift-X | Show the solution |
[ | Previous challenge |
] | Next challenge |
T | Back to top page |
? | Show this dialog |
ESC | Hide this dialog |
Shift-ESC | Blur focus from editor |