aboutsummaryrefslogtreecommitdiff
path: root/python/050-consecutive_prime_sum.py
diff options
context:
space:
mode:
authorCharles <sircharlesaze@gmail.com>2019-11-18 23:22:33 +0100
committerCharles <sircharlesaze@gmail.com>2019-11-18 23:22:33 +0100
commit8d23cd41eb9f4e0cf06715abe27c3999aa80aee9 (patch)
tree119ffa6f073c2e2c43c0c6b0d684213b6c507016 /python/050-consecutive_prime_sum.py
parentfbf74073aeebe4cf64481802c9871012b615d9e7 (diff)
downloadproject_euler-8d23cd41eb9f4e0cf06715abe27c3999aa80aee9.tar.gz
project_euler-8d23cd41eb9f4e0cf06715abe27c3999aa80aee9.tar.bz2
project_euler-8d23cd41eb9f4e0cf06715abe27c3999aa80aee9.zip
problem 50 python
Diffstat (limited to 'python/050-consecutive_prime_sum.py')
-rw-r--r--python/050-consecutive_prime_sum.py31
1 files changed, 31 insertions, 0 deletions
diff --git a/python/050-consecutive_prime_sum.py b/python/050-consecutive_prime_sum.py
new file mode 100644
index 0000000..0fde061
--- /dev/null
+++ b/python/050-consecutive_prime_sum.py
@@ -0,0 +1,31 @@
+# ###
+# Consecutive prime sum
+# Problem 50
+#
+# The prime 41, can be written as the sum of six consecutive primes:
+# 41 = 2 + 3 + 5 + 7 + 11 + 13
+# This is the longest sum of consecutive primes that adds to a prime below one-hundred.
+# The longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms, and is equal to 953.
+# Which prime, below one-million, can be written as the sum of the most consecutive primes?
+# ###
+
+
+from helper.prime import primes_loop, is_prime
+
+
+sumed = []
+ps = []
+max_len = 0
+for p in primes_loop():
+ if p > 20000:
+ break
+ ps.append(p)
+ for i in range(len(ps)):
+ s = sum(ps[i:])
+ if s > 1000000:
+ break
+ if is_prime(s) and len(ps) > max_len:
+ sumed.append(s)
+ max_len = len(ps)
+
+print(sumed[-1])