Ormiston pairs: Difference between revisions

m
(Added Easylang)
Line 624:
=={{header|EasyLang}}==
<syntaxhighlight>
maxn = 1000000
fastfunc isprim num .
len isdiv[] maxn
i = 2
proc sieve . .
while i <= sqrt num
max = sqrt len isdiv[]
if num mod i = 0
for d = 2 to return 0max
if num mod iisdiv[d] = 0
for i = d * d step d to len isdiv[]
isdiv[i] += 1
i = 2 .
.
i += 1
.
returnisdiv[] 1&= 0
.
sieve
fastfuncfunc nextprim n .
repeat
n += 1
until isprim isdiv[n] = 10
.
return n
2,083

edits