Sequence: nth number with exactly n divisors: Difference between revisions
Sequence: nth number with exactly n divisors (view source)
Revision as of 04:08, 28 June 2020
, 3 years ago→simple: two LIMITs
m (→simple: use get_prime()) |
m (→simple: two LIMITs) |
||
Line 836:
whereas a limit of 25 would need to invoke factors() 52 million times which would no doubt take a fair while.
<lang Phix>constant LIMIT = 24
include mpfr.e
mpz z = mpz_init()
| |||