Numbers whose count of divisors is prime: Difference between revisions
Content added Content deleted
(added =={{header|Pascal}}==) |
(→{{header|Wren}}: Takes account of Horsth's observation that only square numbers need to be tested.) |
||
| Line 727: | Line 727: | ||
var limit = 1e5 |
var limit = 1e5 |
||
var results = [] |
var results = [] |
||
var i = 2 |
|||
while (i * i < limit) { |
|||
var n = Int.divisors(i).count |
|||
var n = Int.divisors(i * i).count |
|||
if (n > 2 && Int.isPrime(n)) results.add(i * i) |
|||
i = i + 1 |
|||
} |
} |
||
Fmt.print("Positive integers under $,7d whose number of divisors is an odd prime:", limit) |
Fmt.print("Positive integers under $,7d whose number of divisors is an odd prime:", limit) |
||