Numbers whose count of divisors is prime: Difference between revisions
Content added Content deleted
m (briefer version, no need to make an array of divisors) |
|||
| Line 96: | Line 96: | ||
=={{header|Julia}}== |
=={{header|Julia}}== |
||
<lang julia>using Primes |
<lang julia>using Primes |
||
using Primes |
|||
ispdc(n) = (ndivs = prod(collect(values(factor(n))).+1); ndivs > 2 && isprime(ndivs)) |
ispdc(n) = (ndivs = prod(collect(values(factor(n))).+1); ndivs > 2 && isprime(ndivs)) |
||