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.

Find all combinations in which $a + b + c = 1000$ and then the one in which $a^2 + b^2 = c^2$. Finally, print $abc$



In [65]:

    
for a in range(1,1000):
    for b in range(a + 1, 1000 - a):
        c = 1000 - a - b
        if (a**2 + b**2) == (c**2):
            print(a * b * c)

31875000

Success! It's probably not the most concise solution, but all of my other attempts resulted in infinite loops



In [ ]:

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