Numbers whose count of divisors is prime: Difference between revisions
Numbers whose count of divisors is prime (view source)
Revision as of 10:24, 11 July 2021
, 2 years ago→{{header|Go}}: Slightly simpler.
(→{{header|ALGOL 68}}: No need for a prime sieve - primes have a divisor count of 2.) |
(→{{header|Go}}: Slightly simpler.) |
||
Line 141:
import (
"fmt"
"rcu"
)
Line 152 ⟶ 151:
k = 2
}
for ; i*i <=
if n%i == 0 {
count++
| |||