-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp010.py
More file actions
34 lines (29 loc) · 738 Bytes
/
p010.py
File metadata and controls
34 lines (29 loc) · 738 Bytes
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
# -*- coding: utf-8 -*-
"""
Created on Wed May 15 10:40:28 2013
@author: guillermo
"""
def isprime(n):
'''check if integer n is a prime'''
# make sure n is a positive integer
n = abs(int(n))
# 0 and 1 are not primes
if n < 2:
return False
# 2 is the only even prime number
if n == 2:
return True
# all other even numbers are not primes
if not n & 1:
return False
# range starts with 3 and only needs to go up the squareroot of n
# for all odd numbers
for x in range(3, int(n**0.5)+1, 2):
if n % x == 0:
return False
return True
res = 2
for i in range (3, 2000000, 2):
if isprime(i):
res = res + i
print(str(res))