Ormiston pairs: Difference between revisions

Content added Content deleted

Inline

@@ Line 624: / 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
-         return 0
+   for d = 2 to max
+      if isdiv[d] = 0
+         for i = d * d step d to len isdiv[]
+            isdiv[i] = 1
+         .
       .
-      i += 1
    .
-   return 1
+   isdiv[] &= 0
 .
+sieve
-fastfunc nextprim n .
+func nextprim n .
    repeat
       n += 1
-      until isprim n = 1
+      until isdiv[n] = 0
    .
    return n