Wagstaff primes: Difference between revisions

Content deleted Content added

Inline

@@ Line 496: / Line 496: @@
 <syntaxhighlight lang="easylang">
-proc prime v . r .
+func prime n .
-   r = 1
+   if n mod 2 = 0 and n > 2
-   if v mod 2 = 0 or v mod 3 = 0
+      return 0
-      if v <> 2 and v <> 3
-         r = 0
-      .
-      break 1
    .
-   d = 5
+   i = 3
-   while d * d <= v
+   while i <= sqrt n
-      if v mod d = 0
+      if n mod i = 0
-         r = 0
+         return 0
-         break 2
       .
-      d += 2
+      i += 2
    .
+   return 1
 .
 pri = 1
-nwag = 0
 while nwag <> 10
    pri += 2
-   call prime pri r
+   if prime pri = 1
-   if r = 1
       wag = (pow 2 pri + 1) / 3
-      call prime wag r
+      if prime wag = 1
-      if r = 1
          nwag += 1
          print pri & " => " & wag
@@ Line 528: / Line 521: @@
 .
 </syntaxhighlight>
 =={{header|F_Sharp|F#}}==