Mersenne primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 186: / Line 186: @@
 n = 0
 while true
-      n = n +1
+        n = n +1
-      if isprime(pow(2,n)-1) = 1
+        if isprime(pow(2,n)-1) = 1
-         see n + nl
+           see n + nl
-      ok
+        ok
 end
 func isprime num
-        if (num <= 1) return 0 ok
+       if (num <= 1) return 0 ok
-        if (num % 2 = 0) and num != 2 return 0 ok
+       if (num % 2 = 0) and num != 2 return 0 ok
-        for i = 3 to floor(num / 2) -1 step 2
+       for i = 3 to floor(num / 2) -1 step 2
-             if (num % i = 0) return 0 ok
+            if (num % i = 0) return 0 ok
-        next
+       next
-        return 1
+       return 1
 </lang>
 Output: