Truncatable primes: Difference between revisions

Added Easylang
(add RPL)
(Added Easylang)
 
(2 intermediate revisions by 2 users not shown)
Line 996:
</pre>
 
 
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
if num < 2
return 0
.
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
func isright h .
while h > 0
if isprim h = 0
return 0
.
h = h div 10
.
return 1
.
func isleft h .
d = pow 10 (floor log10 h)
while h > 0
if isprim h = 0
return 0
.
if h div d = 0
return 0
.
h = h mod d
d /= 10
.
return 1
.
p = 999999
while isleft p = 0
p -= 2
.
print p
p = 999999
while isright p = 0
p -= 2
.
print p
</syntaxhighlight>
 
{{out}}
<pre>
998443
739399
</pre>
 
=={{header|EchoLisp}}==
Line 1,184 ⟶ 1,240:
 
=={{header|Elena}}==
ELENA 56.0x :
<syntaxhighlight lang="elena">import extensions;
 
Line 1,197 ⟶ 1,253:
if (n < 2) { ^ false };
if (n < 4) { ^ true };
if (n.mod:(2) == 0) { ^ false };
if (n < 9) { ^ true };
if (n.mod:(3) == 0) { ^ false };
int r := n.sqrt();
Line 3,691 ⟶ 3,747:
{{libheader|Wren-fmt}}
{{libheader|Wren-math}}
<syntaxhighlight lang="ecmascriptwren">import "./fmt" for Fmt
import "./math" for Int
 
var limit = 999999
2,063

edits