Problem 9 - Special pythagorean triplet, Brute force

 - search space is not very big
 - next step is to find a generator function for the triplets
Problem 9 - special pythagorean tiplet, math solution

 - Euclids formula for triples
 - constrain by a+b+c = 1000
 - reduces to find factors of 500 in the form m(m+n) where m > n
 - m = 20, n = 5