'''
prime_test(n) returns a True if n is a prime number else it returns False
'''


def prime_test(n):
    if n <= 1:
        return False
    if n==2 or n==3:
        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:
            return False
        j += 6
    return True

@@ -223,16 +223,17 @@
 lse%0A
+%0A
     j = 
 6%0A  
@@ -228,17 +228,17 @@
     j = 
-6
+5
 %0A    whi
@@ -245,16 +245,17 @@
 le(j*j %3C
+=
  n):%0A   
@@ -270,10 +270,8 @@
 n%25(j
--1
 )==0
@@ -279,17 +279,17 @@
 or n%25(j+
-1
+2
 )==0:%0A  

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