Merge pull request keon#65 from mathagician/master

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

Author: keon

math/prime_test.py

@@ -11,8 +11,8 @@ def prime_test(n):
     if n%2==0 or n%3==0:
         return False
     j = 6
-    while(j*j < n):
+    while((j-1)*(j-1) <= n):
         if n%(j-1)==0 or n%(j+1)==0:
             return False
         j += 6
-    return True
+    return True