Ultra useful primes: Difference between revisions
Content added Content deleted
(Created Nim solution.) |
|||
| Line 245: | Line 245: | ||
10 105 |
10 105 |
||
11 1557</pre> |
11 1557</pre> |
||
=={{header|Nim}}== |
|||
{{libheader|Nim-Integers}} |
|||
<syntaxhighlight lang="Nim">import std/strformat |
|||
import integers |
|||
let One = newInteger(1) |
|||
echo " n k" |
|||
var count = 1 |
|||
var n = 1 |
|||
while count <= 13: |
|||
var k = 1 |
|||
var p = One shl (1 shl n) - k |
|||
while not p.isPrime: |
|||
p -= 2 |
|||
k += 2 |
|||
echo &"{n:2} {k}" |
|||
inc n |
|||
inc count |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> n k |
|||
1 1 |
|||
2 3 |
|||
3 5 |
|||
4 15 |
|||
5 5 |
|||
6 59 |
|||
7 159 |
|||
8 189 |
|||
9 569 |
|||
10 105 |
|||
11 1557 |
|||
12 2549 |
|||
13 2439 |
|||
</pre> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |
||