Primes: n*2^m+1: Difference between revisions
Content added Content deleted
m (Modified <pre> to allow scrolling.) |
(Added Sidef) |
||
Line 2,595: | Line 2,595: | ||
399 2: 1597 |
399 2: 1597 |
||
400 0: 401</pre> |
400 0: 401</pre> |
||
=={{header|Sidef}}== |
|||
{{trans|Perl}} |
|||
Takes ~2 seconds to run. |
|||
<syntaxhighlight lang="ruby" line>for n in (1..400) { |
|||
var p = (^Inf -> lazy.map {|m| [m, n * 2**m + 1] }.first_by { .tail.is_prime }) |
|||
printf("%3s %4s: %s\n", n, p...) |
|||
}</syntaxhighlight> |
|||
(same output as the Perl version) |
|||
=={{header|Wren}}== |
=={{header|Wren}}== |