Project Euler Problem 009

Statement

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.

Solution

Simple brute-force solution.

if __name__ == '__main__':
    a = 1
    b = 1
    c = 1
    for a in range(1, 998):
        for b in range(a, 998):
            c = 1000 - b - a
            if (a ** 2 + b ** 2) == c ** 2:
                break
        if (a ** 2 + b ** 2) == c ** 2:
            break
    print("The result is:", a * b * c)

The Python file is available for download here.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License