-
Notifications
You must be signed in to change notification settings - Fork 0
/
Euler 10.py
52 lines (41 loc) · 1008 Bytes
/
Euler 10.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
from math import sqrt
import functools
def is_prime(n):
if (n <= 1):
return False
if (n == 2):
return True
if (n % 2 == 0):
return False
i = 3
while i <= sqrt(n):
if n % i == 0:
return False
i = i + 2 # can be i + 1 but it's slower and i guess it works anyway idk
return True
#def is_prime_new(n):
# for i in range(1, 2):
# break
#
#while not is_prime()
# vvv from Euler 7 vvv
def find_the_prime():
prime_list = []
x = 0
while(len(prime_list) < 10003):
if is_prime(x):
prime_list.append(x)
x += 1
return prime_list[10000]
def summation_of_primes():
prime_sum_list = []
x = 0
while x <= 2000000:
if is_prime(x):
prime_sum_list.append(x)
x += 1
return prime_sum_list
def list_sum():
print("The summation of primes is:", functools.reduce(lambda a, b: a + b, summation_of_primes()))
print(summation_of_primes())
list_sum()