Rosetta Code

Truncatable primes: Difference between revisions

Page Discussion

Truncatable primes (view source)

Revision as of 15:59, 29 May 2020

494 bytes removed ,  4 years ago
→‎{{header|Wren}}: Now uses Wren-math module.
m (→‎{{header|Wren}}: Library name change.)
(→‎{{header|Wren}}: Now uses Wren-math module.)
Line 3,160:
=={{header|Wren}}==
{{libheader|Wren-fmt}}
{{libheader|Wren-math}}
<lang ecmascript>import "/fmt" for Fmt
import "/math" for Int
 
var sieve = Fn.new { |limit|
limit = limit + 1
// true denotes composite, false denotes prime
var c = List.filled(limit, false)
c[0] = true
c[1] = true
// no need to bother with even numbers over 2 for this task
var p = 3 // Start from 3.
while (true) {
var p2 = p * p
if (p2 >= limit) break
var i = p2
while (i < limit) {
c[i] = true
i = i + 2*p
}
while (true) {
p = p + 2
if (!c[p]) break
}
}
return c
}
 
var limit = 999999
var c = sieveInt.callprimeSieve(limit, false)
var leftFound = false
var rightFound = false
Line 3,231 ⟶ 3,209:
Left truncatable prime = 998,443
Right truncatable prime = 739,399
 
</pre>
 
PureFox
9,485

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/157020"