Mercurial > hg > euler
view problem7.py @ 2:1ca695e32f66
Solutions from tungsten
author | Dominic Cleal <dominic@computerkb.co.uk> |
---|---|
date | Mon, 01 Dec 2008 10:57:01 +0000 |
parents | |
children |
line wrap: on
line source
import math primes = [ 2 ] def isPrime(test): max = math.floor(math.sqrt(test)) t = 0 while t < len(primes) and primes[t] <= max: if test % primes[t] == 0: return False t += 1 return True i = 3 while len(primes) < 10001: if isPrime(i): primes.append(i) i += 2 print primes.pop()