From 9f9bd65f68bed6bf5a3623f90760be0d46bca91c Mon Sep 17 00:00:00 2001
From: Reiner Herrmann <reiner@reiner-h.de>
Date: Sun, 21 Mar 2010 17:55:15 +0100
Subject: project euler solution #27

---
 src/projecteuler/027.py | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 src/projecteuler/027.py

diff --git a/src/projecteuler/027.py b/src/projecteuler/027.py
new file mode 100644
index 0000000..563d6af
--- /dev/null
+++ b/src/projecteuler/027.py
@@ -0,0 +1,25 @@
+from common import sieve
+
+primes = sieve(10000).primes()
+
+def count_primes(a, b):
+	n = 0
+	while True:
+		p = n**2 + a*n + b
+		if p not in primes:
+			break
+		n += 1
+	return n
+
+max_count = 0
+max_pair = (0, 0)
+
+for a in xrange(-999, 1000):
+	for b in xrange(-999, 1000):
+		c = count_primes(a, b)
+		if c > max_count:
+			max_count = c
+			max_pair = (a, b)
+
+print max_pair[0] * max_pair[1]
+
-- 
cgit v1.2.3