Project Euler Problems 7-8

View and download this notebook from nbviewer
In [1]:
from IPython.display import display
from IPython.display import HTML

Problem 7

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10 001st prime number?


Another prime question. Calculating 10,000. We did this before in question 3, time to reuse it..

Method 1: brute force

In [84]:
def isPrime(x):
    if (x==1):
        return False
    for i in range(2,x):
        if x%i==0:
            return False
    return True

def getPrimes(maxValue):
    primes = []
    for i in range(1,maxValue):
        if isPrime(i):
            primes.append(i)
    return primes

primes = getPrimes(10000)
In [86]:
%%timeit
getPrimes(10000)
1 loops, best of 3: 1.25 s per loop

In [85]:
len(primes)
Out[85]:
1229

The brute force solution solution takes more than a second to calculate primes up to 10000. And how many primes did that yield? Only 1229! This doesn't look like a reasonable way to calculate 10000 primes. Luckily, there is a very simple and clever algorithm that can do this job much faster.

Method 2: Sieve of Eratosthenes

The basic notion of the sieve of Eratosthenes is to pre-allocate a list of numbers up to n, and then, taking a prime (starting with 2), cross out every multiple of that prime, as those multiples clearly can't be primes. The next prime is then the next unmarked value in the list. The process repeats until there are no more primes to be found.

In [123]:
def showState(l, p, nx):
    numbers = ''
    for n in l:
        style=''
        if n<0:
            style+='text-decoration: line-through; background-color: rgb(171, 231, 255);'
        if n==p:
            style+='background-color: rgb(230,255,95);'
        if n==nx:
            style+='background-color: rgb(150, 233, 150);'
        if n==0:
            style+='background-color: rgb(220,220,220); color: rgb(220,220,220);'    
        numbers+='{1}'.format(style, abs(n))
    s = """    {0}
"""
.format(numbers) h = HTML(s) display(h) def sieve(size, showStates=True): l = list(range(2,size+1)) #generate the candidate set idx = lambda x: x-2 #just a simple mapping from number in list to list index p = 2 #seed with initial prime for iteration in range(len(l)): #mark every multiple of p for i in range(p*2, size+1, p): l[idx(i)] = -i #find the next unmarked value, that's the next p nextPrime = 0 for i in l[idx(p+1):]: if i>0: nextPrime = i break if (showStates): showState(l, p, nextPrime) for i in range(p*2, size+1, p): l[idx(i)] = 0 p = nextPrime #if we haven't found any unmarked values, we're done if p == 0: break #return all unmarked values return filter(lambda x: x>0, l) sieve(38, True)
234567891011121314151617181920212223242526272829303132333435363738
23056709011121301501718190210232425027029303103303536370
230507001011013015017019200023025000293031000350370
2305070001101314001701902102300002829031000350370
23050700011013000170190022230000029031033000370
2305070001101300017019000230026002903100000370
2305070001101300017019000230000029031003400370
2305070001101300017019000230000029031000003738
230507000110130001701900023000002903100000370
230507000110130001701900023000002903100000370
230507000110130001701900023000002903100000370
230507000110130001701900023000002903100000370
Out[123]:
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]

Above is the state of the preallocated list at each iteration of sifting primes up to 38.

Starting with a fully unmarked list, and the first prime, 2 (shown in yellow), every multiple of 2 is marked off in the list (shown in blue). The next prime (green) is then found by moving up the list until the first unmarked number.

The next iteration starts at the newly found prime, 3, and proceeds to mark off every multiple of 3 in the list, and so forth.

Finally, the last iteration attempts to find unmarked values to the right of 37 and finds none. At that point the algorithm can terminate and return the remaining unmarked values in the list.

In [58]:
%%timeit
v = sieve(10000, False)
10 loops, best of 3: 55.2 ms per loop

In [72]:
len(sieve(10000, False))
Out[72]:
1229

At less than 60ms to find all primes less than 10000, this algorithm is orders of magnitude faster.

It can be further optimized by recognizing that if one divisor or factor of a number (other than a perfect square) is greater than its square root, then the other factor will be less than its square root. Hence all multiples of primes greater than the square root of n need not be considered[1]. The sieve function can be trivially modified to use this knowledge by limiting the marking phase to \(\sqrt{n}\)

[1] http://britton.disted.camosun.bc.ca/jberatosthenes.htm

In [73]:
#comments removed for brevity
def sieve(size, showStates=True):
    l = list(range(2,size+1)) 
    idx = lambda x: x-2 
    p = 2 
    for iteration in range(int(0.5+len(l)**0.5)):
        #mark every multiple of p up to sqrt(n)
        for i in range(p*2, size+1, p):
            l[idx(i)] = -i
        nextPrime = 0
        for i in l[idx(p+1):]:
            if i>0:
                nextPrime = i
                break
        if (showStates):
            showState(l, p, nextPrime)
            for i in range(p*2, size+1, p):
                l[idx(i)] = 0
        p = nextPrime
        if p == 0:
            break
    return filter(lambda x: x>0, l)
In [74]:
%%timeit
v = sieve(10000, False)
100 loops, best of 3: 13.2 ms per loop

So the Eratosthenes sieve is very fast at finding primes up to some limit m. At m=10000, we find n=1229. What range do we have to sieve to actually get our n=1000 primes?

Rosser's theorem[2] provides a useful inequality that establishes bounds on the value of the nth prime number:

\(\ln n + \ln\ln n - 1 < \frac{p_n}{n} < \ln n + \ln \ln n \quad\text{for } n \ge 6\)

[2] http://en.wikipedia.org/wiki/Prime_number_theorem#Approximations_for_the_nth_prime_number

In [114]:
def maxPrime(n):
    return int(0.5+(float(n)*log(n)+ n*log(log(n))))
    
limit = maxPrime(10000)
print('The 10000th prime has a value < {0}'.format(limit))
The 10000th prime has a value < 114307

In [115]:
primes = sieve(limit, False)
len(primes)
Out[115]:
10816

The upper bound function appears to have done it's job and netted just over 10000 primes. We can now obtain the 10001st

In [118]:
primes[10000]
Out[118]:
104743

Problem 8

The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?


In [121]:
source = '''
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
'''.replace('\n','')

#break the source string into a series of 13 character long slices at every possible position
window_size = 13
slices = [source[x:x+window_size] for x in range(len(source) - window_size + 1)]

#compute the product of each slice
products = [product(map(int, row), dtype='int64') for row in slices]

max(products)
Out[121]:
23514624000

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>