Project Euler - Problem 41

problem41.py

import math, itertools, time

def is_prime(n):
    if n < 2:
        return False

    limit = math.floor(math.sqrt(n))
    for i in range(2, limit+1):
        if n%i == 0:
            return False

    return True

if __name__ == "__main__":
    t0 = time.time()
    s = '7654321'
    for x in itertools.permutations(s):
        n = int(''.join(x))
        if is_prime(n):
            print(n)
            break
    t1 = time.time()
    print("The solution took", t1-t0, "seconds")