def IsOkay(n): f = False for i in range(2, n): if n % i == 0: f = True return not f
def IsPrime(n): for divisor in range(2, n / 2): if n % divisor == 0: return False return True
