Euler Problem 27 solution script Added

project_euler/Problem_27/sol1.py

@@ -11,38 +11,52 @@
 
 import math
 
+
 def isPrime(k):
-	# checks if a number is prime
-	if k < 2: return False
-	elif k == 2: return True
-	elif k % 2 == 0: return False
-	else:
-		for x in range(3, int(math.sqrt(k)+1), 2):
-			if k % x == 0: return False
+    # checks if a number is prime
+    if k < 2:
+        return False
+    elif k == 2:
+        return True
+    elif k % 2 == 0:
+        return False
+    else:
+        for x in range(3, int(math.sqrt(k) + 1), 2):
+            if k % x == 0:
+                return False
 
-	return True
+    return True
 
 
 def solution(a_limit, b_limit):
+    """
+	>>> solution(1000, 1000)
+	-59231
+	>>> solution(2000, 2000)
+	-126479
+	>>> solution(-1000, 1000)
+	0
+	>>> solution(-1000, -1000)
+	0
+
+	"""
     longest = [0, 0, 0]
-	# length, a, b
+    # length, a, b
     for a in range((a_limit * -1) + 1, a_limit):
         for b in range(2, b_limit):
             if isPrime(b):
                 count = 0
                 n = 0
-                while isPrime((n**2) + (a*n) + b):
+                while isPrime((n ** 2) + (a * n) + b):
                     count += 1
                     n += 1
 
                 if count > longest[0]:
                     longest = [count, a, b]
 
-    ans=longest[1]*longest[2]
+    ans = longest[1] * longest[2]
     return ans
 
 
-
-
 if __name__ == "__main__":
-	print(solution(1000, 1000))
+    print(solution(1000, 1000))