Numbers whose count of divisors is prime: Difference between revisions
Numbers whose count of divisors is prime (view source)
Revision as of 15:36, 11 July 2021
, 2 years ago→{{header|Go}}: Takes account of Horsth's observation that only square numbers need to be tested.
(→{{header|Wren}}: Takes account of Horsth's observation that only square numbers need to be tested.) |
(→{{header|Go}}: Takes account of Horsth's observation that only square numbers need to be tested.) |
||
Line 166:
const limit = 1e5
var results []int
for i :=
n := countDivisors(i * i)
if n > 2 && rcu.IsPrime(n) {
results = append(results, i * i)
}
}
| |||