A -smooth number is an integer which has no prime factor larger than . For an integer , we define as the set of -smooth numbers less than or equal to . For example, .
We define as the number of permutations of in which each element comes after all of its proper divisors.
This is one of the possible permutations for .
-
This is not a valid permutation because comes before its divisor .
- .
We can verify that , , and .
Find . Give as your answer its scientific notation rounded to ten digits after the decimal point.
When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is then the answer format would be 1.1223344557e17.
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.