def test_is_prime(self): for p in primes.primes(20000): self.assertTrue(primes.is_prime(p), 'Prime %d fails prime check' % p)
def problem_ten(): """ Find the sum of all the primes below two million. """ limit = 2000000 return sum(primes(limit))
def test_primes(self): prime_list = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47] self.assertEqual(prime_list, primes.primes(50))