Summarize primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 662: / Line 662: @@
 =={{header|EasyLang}}==
 <syntaxhighlight lang="easylang">
-proc prime x . r .
+func prime n .
-   for i = 2 to sqrt x
+   if n mod 2 = 0 and n > 2
-      if x mod i = 0
+      return 0
-         r = 0
+   .
-         break 2
+   i = 3
+   while i <= sqrt n
+      if n mod i = 0
+         return 0
       .
+      i += 2
    .
-   r = 1
+   return 1
 .
 for i = 2 to 999
-   call prime i r
+   if prime i = 1
-   if r = 1
       ind += 1
       sum += i
-      call prime sum r
+      if prime sum = 1
-      if r = 1
          print ind & ": " & sum
       .