projecteuler solution 47

2 files changed, 27 insertions, 2 deletions

diff --git a/src/projecteuler/047.py b/src/projecteuler/047.py
new file mode 100644
index 0000000..19f5185
--- /dev/null
+++ b/src/projecteuler/047.py
@@ -0,0 +1,25 @@
+from common import sieve
+
+primes = list(sieve(1000000).primes())
+primes.sort()
+
+factors = 4
+
+def check_prime_factors(x):
+	distinct = set()
+	for p in primes:
+		while x % p == 0:
+			x /= p
+			distinct.add(p)
+		if x == 1:
+			break
+	return len(distinct) == factors
+
+n = 644
+
+while True:
+	if check_prime_factors(n) and check_prime_factors(n+1) and check_prime_factors(n+2) and check_prime_factors(n+3):
+		print n
+		break
+	n += 1
+
diff --git a/src/projecteuler/common.py b/src/projecteuler/common.py
index 8bc4953..a903ff8 100644
--- a/src/projecteuler/common.py
+++ b/src/projecteuler/common.py
@@ -125,8 +125,8 @@ def prime_test(n): # aks test
 	if n <= r*r:
 		return True
 
-	for a in xrange(1, math.floor(math.sqrt(phi(r))*logn)):
-		# TODO if math.pow(x+a, n) != 
+	#for a in xrange(1, math.floor(math.sqrt(phi(r))*logn)):
+	#	# TODO if math.pow(x+a, n) != 
 	
 	return True