10001th prime: Difference between revisions

Line 586:
=={{header|EasyLang}}==
<syntaxhighlight lang="easylang">
fastfunc isPrimeisprim num .
if num mod 2 = 0 and num > 2
return 0
Line 599:
return 1
.
curPrimei = 12
repeat
for i = 1 to 10001
if isprim i = 1
repeat
curPrimenprim += 1
until isPrime curPrime = 1
.
until nprim = 10001
i += 1
.
print curPrimei
</syntaxhighlight>
{{out}}
2,056

edits