Project Euler #35

euler35.py

from itertools import takewhile
from itertools import count
from math import sqrt
from math import log

def rotate(n):
    d = int(log(n, 10))
    m = 10 ** d
    for _ in range(d):
        r = n % 10
        n /= 10
        n += m * r
        yield n

def isprime(n):
    for x in range(2, int(sqrt(n)) + 1):
        if n % x == 0:
            return 0
    return 1

def isprimel(l):
    for p in l:
        if not isprime(p):
            return 0
    return 1

def prime():
    primes = []
    for n in count(2):
        composite = 0
        for p in primes:
            if not n % p:
                composite = 1
                break
            elif p ** 2 > n:
                break
        if not composite:
            primes.append(n)
            yield n

print sum(1 for _ in
                (p for p in
                    (takewhile(lambda n: n < 1000000, prime()))
                        if isprimel(rotate(p))))