import math
liste_primes = []
def is_prime(n):
if n == 1:
return False
elif n == 2:
liste_primes.append(n)
else:
for i in range(2,math.isqrt(n) + 1):
if n % i == 0:
return False
liste_primes.append(n)
def sum_primes(k):
if k == 2:
return 0
else:
for k in range(2, k+1):
is_prime(k)
return sum(liste_primes)