Ascending primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 699: / Line 699: @@
     }
-    private boolean isPrime(int value) {
+    private boolean isPrime(int n) {
-        if (value == 2) {
+        if (n == 2) {
             return true;
         }
-        if (value == 0 || value == 1 || value % 2 == 0) {
+        if (n == 1 || n % 2 == 0) {
             return false;
         }
-        int root = (int) Math.sqrt(value);
+        int root = (int) Math.sqrt(n);
         for (int k = 3; k <= root; k += 2) {
-            if (value % k == 0) {
+            if (n % k == 0) {
                 return false;
             }