Project Euler 6~10

Problem 6:

The sum of the squares of the first ten natural numbers is,

1 ² + 2 ² + ... + 10 ² = 385

The square of the sum of the first ten natural numbers is,

(1 + 2 + ... + 10) ² = 55 ² = 3025

Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025  385 = 2640.

Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.

ans1=ans2=0
for i in range(1,100+1):
    ans1+=i
    ans2+=i*i
print(ans1*ans1-ans2)

Answer:25164150

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?

a=[0 for i in range(1,5000000+10)]
p=a
tot=0
for i in range(2,5000000):
    if a[i]==0:
        tot+=1
        p[tot]=i
        if tot==10001:
            print(i)
            break
        j=i+i
        while j<5000000:
            a[j]=1
            j+=i

Answer:104743

Problem 8:

Find the greatest product of five consecutive digits in the 1000-digit number.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

s='7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
ans=0
for i in range(0,len(s)-5+1):
    a=int(s[i])
    b=int(s[i+1])
    c=int(s[i+2])
    d=int(s[i+3])
    e=int(s[i+4])
    if a*b*c*d*e>ans:
        ans=a*b*c*d*e
print(ans)

Answer:40824

Problem 9:

A Pythagorean triplet is a set of three natural numbers, a  b  c, for which,

a ² +  b ² =  c ²

For example, 3² + 4² = 9 + 16 = 25 = 5².

There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.

for i in range(0,1000+1):
    for j in range(i+1,1000-i+1):
        k=1000-i-j
        if k>j and i*i+j*j==k*k:
            print(i*j*k)
            break

Answer:31875000

Problem 10:

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.

a=[0 for i in range(1,2000000+10)]
ans=0
for i in range(2,2000000+1):
    if a[i]==0:
        ans+=i
        j=i+i
        while j<=2000000:
            a[j]=1
            j+=i
print(ans)

Answer:142913828922

By Charlie Pan

Apr 14,2014