def is_prime(n):
# 迭代
if n == 1:
return False
else:
for i in range(2, n // 2):
if n % i == 0:
return False
return True
#递归
def f(m, x):
if x == 1:
return True
elif m % x == 0:
return False
return f(m, x - 1)
return f(n, n - 1) if n >= 2 else False