(n)
return True
memorized prime evaluation, 2x more faster on that algorithm
memorized prime evaluation, 2x more faster on that algorithm
memorized prime evaluation 2x more faster on that algorithm
def isprime(n):
    """memorized prime evaluation, 2x more faster on that algorithm"""
    for p in range(2, int(abs(n) ** 0.5) + 1):
        if n % p == 0:
            return False

    return True
def isprime ( n ) : for p in range ( 2 , int ( abs ( n ) ** 0.5 ) + 1 ) : if n % p == 0 : return False return True