Circular primes: Difference between revisions
m
→{{header|EasyLang}}
Line 913:
{{trans|AWK}}
<syntaxhighlight lang="easylang">
while i <= sqrt n and r = 1▼
sq = sqrt n
if n mod i = 0
.
i +=
.
return 1
.
m = n
p = 1
Line 930 ⟶ 934:
m = m div 10
.
.
.
while p2 <> p
if p2 < p or prime p2 = 0
▲ .
.
.
.
p = 2
while count < 19
▲ if r = 1
print p
count += 1
| |||