Emirp primes: Difference between revisions

m
(Added Easylang)
 
Line 839:
<syntaxhighlight>
fastfunc isprim num .
ifi num mod= 2 = 0
if num = 2
return 1
.
return 0
.
i = 3
while i <= sqrt num
if num mod i = 0
return 0
.
i += 21
.
return 1
Line 889 ⟶ 883:
cnt = 0
repeat
ifcnt += isemirp m = 1
cnt += 1
.
until cnt = 10000
m += 1
2,083

edits