Truncatable primes: Difference between revisions
Content deleted Content added
Line 1,054: | Line 1,054: | ||
<lang nimrod>import sets, strutils, algorithm |
<lang nimrod>import sets, strutils, algorithm |
||
proc primes(n): seq[ |
proc primes(n): seq[int64] = |
||
result = @[] |
result = @[] |
||
var multiples = initSet[ |
var multiples = initSet[int64]() |
||
for i in 2..n: |
for i in 2..n: |
||
if i notin multiples: |
if i notin multiples: |
||
result.add i |
result.add i |
||
for j in countup(i*i, n, i): |
for j in countup(i*i, n, i.int): |
||
multiples.incl j |
multiples.incl j |
||
proc truncatablePrime(n): tuple[left: |
proc truncatablePrime(n): tuple[left: int64, right: int64] = |
||
var |
var |
||
primelist: seq[string] = @[] |
primelist: seq[string] = @[] |
||
Line 1,085: | Line 1,085: | ||
break |
break |
||
echo truncatablePrime(1000000)</lang> |
echo truncatablePrime(1000000'i64)</lang> |
||
Output: |
Output: |
||
<pre>(left: 999961, right: 739399)</pre> |
<pre>(left: 999961, right: 739399)</pre> |