# Project Euler

## Special Pythagorean triplet

### Problem 9

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

a2 + b2 = c2

For example, 32 + 42 = 9 + 16 = 25 = 52.

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 ($O(n^2)$) 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.