Numbers whose count of divisors is prime: Difference between revisions
Content added Content deleted
(add RPL) |
m (→{{header|Wren}}: Minor tidy) |
||
| Line 1,617: | Line 1,617: | ||
=={{header|Wren}}== |
=={{header|Wren}}== |
||
{{libheader|Wren-math}} |
{{libheader|Wren-math}} |
||
{{libheader|Wren-seq}} |
|||
{{libheader|Wren-fmt}} |
{{libheader|Wren-fmt}} |
||
<syntaxhighlight lang=" |
<syntaxhighlight lang="wren">import "./math" for Int |
||
import "/ |
import "./fmt" for Fmt |
||
import "/fmt" for Fmt |
|||
var limit = 1e5 |
var limit = 1e5 |
||
| Line 1,632: | Line 1,630: | ||
} |
} |
||
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) |
||
Fmt.tprint("$,7d", results, 10) |
|||
for (chunk in Lst.chunks(results, 10)) Fmt.print("$,7d", chunk) |
|||
var under1000 = results.count { |r| r < 1000 } |
var under1000 = results.count { |r| r < 1000 } |
||
System.print("\nFound %(results.count) such integers (%(under1000) under 1,000).")</syntaxhighlight> |
System.print("\nFound %(results.count) such integers (%(under1000) under 1,000).")</syntaxhighlight> |
||