#print(sum([i for i in range(1000) if i % 3 == 0 or i % 5 == 0])) #id 1

#id 2
def sumEvenFib(a,b,n,results=0): #fib sequence <= n
#a,b = 1,2 #euler defines first 2 terms as this weirdly
#1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...(first 10 terms)
while (b) < n:
if b % 2 == 0:
print(f"EVEN:{b}")
results += b
temp = a + b
a = b
b = temp
print(a,b)
return results

#print(sumEvenFib(1,2,4000000))

def fib(n): #first n terms of fib

if n == 1: return 1
if n == 2: return 2
results = [1,2]
a,b = results
for i in range(n-2):
temp = a + b
a = b
b = temp
results.append(temp)
return results

def isPrime(n):
if n == 2: return True
if n % 2 == 0: return False
for i in range(3,n):
if n % i == 0:
return False
return True

def primesLessThan(n):
results = []
for i in range(2,n):
if isPrime(i): results.append(i)
return results

primes = primesLessThan(100000)
print(primes)

#6
sum(range(1,101))**2 - sum(map(lambda x:x**2,range(1,101)))