def sumOfPrimesInRange( lowerBound, upperBound ):
'''
Upper bound not included.
'''
sum = 0
lowerBound = getNextPrime( lowerBound - 1 )
while lowerBound < upperBound:
#print sum, ' += ', lowerBound
sum += lowerBound
lowerBound = getNextPrime( lowerBound )
return sum
def primes(n): """ Returns a list of the first n prime numbers """ primes = [2,3] for i in range(len(primes), n): primes.append(getNextPrime(primes)) return primes[-1]
def getPrimes(uBound): """ Returns a list of primes smaller than or equal to uBound """ primes = [2,3] while primes[-1] <= uBound: primes.append(getNextPrime(primes)) if primes[-1] > uBound: primes.pop() return primes
def testGetNextPrime(self): self.assertEqual(19, getNextPrime([2,3,5,7,11,13,17])) self.assertEqual(23, getNextPrime([2,3,5,7,11,13,17,19]))
