def test_is_prime():
assert not euler.is_prime(1)
for p in [2,3,5,7,11,13,17,19,23]:
assert euler.is_prime(p)
for np in [4,6,8,9,10,12,14,15,16,18,20,21,22]:
assert not euler.is_prime(np)
def process(n):
global cnt
if is_prime(n):
cnt += 1
def test_is_prime_mr():
a_under_1000 = [i for i in range(2, 1000) if euler.is_prime(i)]
b_under_1000 = [i for i in range(2, 1000) if euler.is_prime_mr(i)]
assert a_under_1000 == b_under_1000
def test_is_prime():
assert not euler.is_prime(1)
for p in [2, 3, 5, 7, 11, 13, 17, 19, 23]:
assert euler.is_prime(p)
for np in [4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22]:
assert not euler.is_prime(np)
def test_is_prime_mr():
a_under_1000 = [i for i in range(2, 1000) if euler.is_prime(i)]
b_under_1000 = [i for i in range(2, 1000) if euler.is_prime_mr(i)]
assert a_under_1000 == b_under_1000
def process(n):
global cnt
if is_prime(n):
cnt += 1
def main():
global cnt
for n in xrange(1, UPTO):
if is_prime(n):
cnt += 1
print cnt
