Fix | keon#58 | Correct the logic of Prime testing function in math/test_prime.py in an efficient way

harshtheworkman · harshtheworkman · commit a4ca73b21492 · 2017-05-14T13:41:51.000+05:30
diff --git a/math/prime_test.py b/math/prime_test.py
@@ -10,9 +10,10 @@ def prime_test(n):
         return True
     if n%2==0 or n%3==0:
         return False
-    j = 6
-    while(j*j < n):
-        if n%(j-1)==0 or n%(j+1)==0:
+
+    j = 5
+    while(j*j <= n):
+        if n%(j)==0 or n%(j+2)==0:
             return False
         j += 6
     return True
