Additive primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,466: / Line 1,466: @@
 <syntaxhighlight lang="easylang">
+func prime n .
-proc isprime x . r .
-   r = 1
+   if n mod 2 = 0 and n > 2
-   for i = 2 to sqrt x
+      return 0
+   .
-      if x mod i = 0
-         r = 0
+   i = 3
-         break 2
+   sq = sqrt n
+   while i <= sq
+      if n mod i = 0
+         return 0
       .
+      i += 2
    .
+   return 1
 .
-proc digsum n . sum .
+func digsum n .
-   sum = 0
    while n > 0
       sum += n mod 10
       n = n div 10
    .
+   return sum
 .
 for i = 2 to 500
-   call isprime i r
+   if prime i = 1
-   if r = 1
+      s = digsum i
-      call digsum i s
+      if prime s = 1
-      call isprime s r
-      if r = 1
          write i & " "
       .