Palindromic primes: Difference between revisions
Content added Content deleted
(Added Oberon-07) |
(Added Easylang) |
||
Line 369: | Line 369: | ||
</pre> |
</pre> |
||
=={{header|EasyLang}}== |
|||
<syntaxhighlight> |
|||
fastfunc isprim num . |
|||
i = 2 |
|||
while i <= sqrt num |
|||
if num mod i = 0 |
|||
return 0 |
|||
. |
|||
i += 1 |
|||
. |
|||
return 1 |
|||
. |
|||
func reverse s . |
|||
while s > 0 |
|||
e = e * 10 + s mod 10 |
|||
s = s div 10 |
|||
. |
|||
return e |
|||
. |
|||
for i = 2 to 999 |
|||
if isprim i = 1 |
|||
if reverse i = i |
|||
write i & " " |
|||
. |
|||
. |
|||
. |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
2 3 5 7 11 101 131 151 181 191 313 353 373 383 727 757 787 797 919 929 |
|||
</pre> |
|||
=={{header|Factor}}== |
=={{header|Factor}}== |