Ascending primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 367: / Line 367: @@
         static bool isPrime(uint n)
         {
-            if (n == 0 || n == 1)
+            if (n == 2)
+                return true;
+            if (n == 1 || n % 2 = 0)
                 return false;
-            if (n != 2)
+            uint root = (uint)Math.Sqrt(n);
-            {
+            for (uint k = 3; k <= root; k += 2)
-                if (n % 2 == 0)
+                if (n % k == 0)
                     return false;
-                uint root = (uint)Math.Sqrt(n);
-                for (uint k = 3; k <= root; k += 2)
-                    if (n % k == 0)
-                        return false;
-            }
             return true;
         }