-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path50.py
52 lines (37 loc) · 1022 Bytes
/
50.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
import math
from copy import copy
LIMIT = 1000000
def IsPrime(number):
if (number == 2):
return True
for i in range(2, int(math.ceil(math.sqrt(number))) + 1):
if (number % i == 0):
return False
return True
def CreatePrimesList():
list = []
for i in range(2, LIMIT):
if (IsPrime(i)):
list.append(i)
return list
def FindLongestSumPrime():
primes_list = CreatePrimesList()
longest_terms_list_length = 0
longest_sum = 0
for i in primes_list:
current_terms_list_length = 1
current_sum = i
for j in primes_list:
if (j <= i):
continue
current_sum += j
current_terms_list_length += 1
if (current_sum >= LIMIT):
break
if (IsPrime(current_sum)):
if (current_terms_list_length > longest_terms_list_length):
longest_terms_list_length = current_terms_list_length
longest_sum = current_sum
print longest_terms_list_length
return longest_sum
print FindLongestSumPrime()