Sequence: smallest number with exactly n divisors: Difference between revisions
Sequence: smallest number with exactly n divisors (view source)
Revision as of 07:25, 8 June 2019
, 5 years ago→{{header|Phix}}
Line 388:
=={{header|Phix}}==
Using the formulae from the OEIS:A005179 link above.<br>
Uses primes[] and add_block() from [[Extensible_prime_generator#Phix|Extensible_prime_generator]]
product() has recently been added as a new builtin, if you need it see [[Deconvolution/2D%2B#Phix]].
<lang Phix>constant limit = iff(machine_bits()=32?58:66)
| |||