Sequence: nth number with exactly n divisors: Difference between revisions
Sequence: nth number with exactly n divisors (view source)
Revision as of 21:37, 2 June 2019
, 5 years ago→{{header|Phix}}
Line 615:
=={{header|Phix}}==
{{libheader|mpfr}}
Certainly not the fastest way to do it, hence the relatively small limit of 24, which takes less than 0.4s,<br>
whereas a limit of 25 would need to invoke factors() 52 million times which would no doubt take a fair while.
| |||