# Project Euler

## Special Pythagorean triplet

### 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`.

Using two loops, outer loop iterates the value of a and inner loop iterates value of b, the value of c can be checked easily against the criteria. However, this brute force approach is not very efficient () but it is simple. The overview from this problem is definitely worth looking at to understand the parametrization of Pythagorean triplets and solve this problem faster.