Numbers whose count of divisors is prime: Difference between revisions
Numbers whose count of divisors is prime (view source)
Revision as of 15:33, 11 July 2021
, 2 years ago→{{header|Wren}}: Takes account of Horsth's observation that only square numbers need to be tested.
(added =={{header|Pascal}}==) |
(→{{header|Wren}}: Takes account of Horsth's observation that only square numbers need to be tested.) |
||
Line 727:
var limit = 1e5
var results = []
var i = 2
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)
| |||