Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 16:05, 8 June 2019
, 5 years ago→{{header|Phix}}
Line 419:
Note: the f[2]>2 test should really be something more like >log(get_primes(-(lf-1))[$])/log(2),
apparently, but everything seems ok within the IEEE 754 53/64 bit limits this imposes.
It takes longer, afaict, to print the answers
{{out}}
64-bit (as shown) manages 8 more answers than 32-bit, which as per limit halts on 58.
| |||