diff options
| author | Reiner Herrmann <reiner@reiner-h.de> | 2014-08-31 20:21:45 +0200 |
|---|---|---|
| committer | Reiner Herrmann <reiner@reiner-h.de> | 2014-08-31 20:35:09 +0200 |
| commit | 95341b61b030c9e1290f3b326cb7ec584f543aea (patch) | |
| tree | 852386fa04d32eb859bca11c0eff7b5ef9e50f00 /041.py | |
| parent | 571164d977f91925c4c76a292f74f5f93d09ae23 (diff) | |
Diffstat (limited to '041.py')
| -rw-r--r-- | 041.py | 26 |
1 files changed, 26 insertions, 0 deletions
@@ -0,0 +1,26 @@ +from common import pandigital, sieve + +primes = list(sieve(10**6).primes()) +numbers = [x for x in pandigital(1, 9).numbers(10) if x > 10**8] +numbers += [x for x in pandigital(1, 8).numbers(10) if x > 10**7] +numbers += [x for x in pandigital(1, 7).numbers(10) if x > 10**6] +numbers += [x for x in pandigital(1, 6).numbers(10) if x > 10**5] +numbers += [x for x in pandigital(1, 5).numbers(10) if x > 10**4] +numbers += [x for x in pandigital(1, 4).numbers(10) if x > 10**3] +numbers += [x for x in pandigital(1, 3).numbers(10) if x > 10**2] +numbers += [x for x in pandigital(1, 2).numbers(10) if x > 10**1] + +numbers.sort(reverse=True) + +# check for divisibility up to sqrt(n), as sieve requires too much memory +def is_prime(n): + for p in primes: + if n % p == 0: + return False + return True + +for n in numbers: + if is_prime(n): + print n + break + |
