Mercurial > hg > euler
changeset 13:836a4ccbcbae
#35 solution
author | Dominic Cleal <dominic@computerkb.co.uk> |
---|---|
date | Mon, 01 Dec 2008 13:14:53 +0000 |
parents | 76155198a9e2 |
children | 49c96972949d |
files | problem35.py |
diffstat | 1 files changed, 23 insertions(+), 0 deletions(-) [+] |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/problem35.py Mon Dec 01 13:14:53 2008 +0000 @@ -0,0 +1,23 @@ +import primes + +def rotate(ps): + return ps[1:] + ps[0] + +def testrotate(p): + ps = str(p) + for r in range(1, len(ps)): + ps = rotate(ps) + if not s.isprime(int(ps)): + return False + return True + +c = 0 +s = primes.testsieve() +for p in s.sieve(): + if p > 1000000: + break + if testrotate(p): + c += 1 + +print "Found %d circular primes" % (c) +