1.define a function is_prime that takes a numbers x as input.
2.for each number n from 2 to x-1 ,test if x is evenly divisible by n
3.if it is,return False
4.if none of them are,then return True
1.def is_prime(x):
if x<2:
return False
for n in range(2,x):
if x% n == 0:
return False
return True
2.def is_prime(x):
if x<2:
return False
else:
for n in range(2,x):
if x % n == 0:
return False
else:
return True
3.def is_prime(x):
for n in range(2,x):
if x % n == 0:
return False
if x< 2:
return False
return True
