def test_primes1e6(self): test_primes = P.primes(1000000) self.assertEqual(len(test_primes),78498)
#Stupid problems require stupid solutions from eulerlib import prime_numbers ps = prime_numbers.primes(2000000) print(sum(ps))
def test_primes1e5(self): test_primes = P.primes(100000) self.assertEqual(len(test_primes),9592) self.assertEqual(test_primes[-1],99991)
def test_primes1e4(self): test_primes = P.primes(10000) self.assertEqual(len(test_primes),1229) self.assertEqual(test_primes[-1],9973)
def test_primes1e3(self): test_primes = P.primes(1000) self.assertEqual(len(test_primes),168) self.assertEqual(test_primes[-1],997)
def test_primes1e2(self): test_primes = P.primes(100) self.assertEqual(len(test_primes),25) self.assertEqual(test_primes[-1],97)
def test_primes1e1(self): test_primes = P.primes(10) self.assertEqual(len(test_primes),4) #Number of prime self.assertEqual(test_primes[-1],7) #Last prime in the list