Project Euler Forum

I am having issues with scaling my solution to 100!

For now, I would like to ask whether my solution for 50! is correct or not.

I found there are <snipped> "families" of product pairs -- each family is where the number of divisors of either element in the pair is the same. E.g., I found <snipped> pairs where either factor has <snipped> divisors; <snipped> pairs each having <snipped> divisors, etc.

C(50!) = <snipped>
The program literally ran for several hours.

In general, how do I find a, b, c, ... such that

<snipped>

Can anyone nudge me towards a Wikipedia or Wolfram article that would get me going?

thank you,

The answer you gave for C(50!) is correct.
I removed possible spoilers of any kind.

hk wrote: Thu Aug 17, 2017 8:23 pm The answer you gave for C(50!) is correct.

Thank you for confirmation.