def is_prime(n):
for i in range(2, n):
if n % i == :
return False
return True
B
def is_prime(n):
for i in range(2, int(n**.5) + 1):
if n % i == :
return False
return True
C
def is_prime(n):
if n <= 1:
return False
if n == 2:
return True
if n % 2 == :
return False
for i in range(3, int(n**.5) + 1, 2):
if n % i == :
return False
return True
D
def is_prime(n):
for i in range(2, n//2):
if i % n == :
return False
return True