Search:

Problem 160 - Project Euler

Problem 160. I've been working on it for a while. First attempt was to brute force the factorial using JScience's LargeInteger class and huge multi-threading. That took...

Ok, well, you can use De Polignac's formula to figure out how many factors of a prime factor there are in n!.



Could you also explain this a different way?



This is a project Euler...

For a problem I'm working on, I need to calculate some very, very large factorials; or at least the first five non-zero digits of said factorial. I've worked out the function:

F(n) =...