def getAnswer(n):
cnt=1
getPrimes = getPrimesUpTo(float('inf'))
while cnt<n:
cnt+=1
next(getPrimes)
return next(getPrimes)
def getCountOfSumsOfPrimeSubsets(upTo):
primes = primeUtil.getPrimesUpTo(upTo)
primeSums = getPrimeSums(primes)
count=0
for sum in primeSums:
if primeUtil.isPrime(sum):
count += primeSums[sum]
print(primeSums)
return count
def factorCardByPrime(n):
if n==0 or n==1: return 0
for prime in getPrimesUpTo(sqrt(n)):
if n%prime==0:
card=factorCardByPrime(n/prime)
if prime not in card:
card[prime]=1
else:
card[prime]+=1
return card
return {int(n): 1}
def test_itGetsCorrectPrimes(n): assert list(getPrimesUpTo(n[0]))[-1]==n[1]
def test_itGetsAllPrimes(n): assert len(list(getPrimesUpTo(n[0])))==n[1]
