Project Euler: Problem 9

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

$$a^2 + b^2 = c^2$$

For example, $3^2 + 4^2 = 9 + 16 = 25 = 5^2$.

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



In [1]:

    
#The code cycles 'a' from (0 to 500) for all 'b' (0 to 500), then it gets c and checks the condition a^2 + b^2 = c^2
a = 0

while (a < 500):
    a = a + 1
    b = 0
    
    while (b < 500):
        b = b + 1
        c = 1000 - (a + b) #This guarantees that the condition a + b + c = 1000 is met
        
        if ((c*c) == ((a*a) + (b*b))): #This checks the second condition
            x = (a*b*c)
print (x)
# YOUR CODE HERE
#raise NotImplementedError()

31875000



In [ ]:

    
# This cell will be used for grading, leave it at the end of the notebook.