how can i write a function which computes all the unique Pythagorian Triples up to a given value. A Pythagorian Triple is a set of three numbers where the square of the first number plus the square of the second number equals the square of the third number. For example, 3,4, and 5 are a Pythagorian Triple. Store the values in a two dimensional int array. Make sure there are no multiples of previously found triple. For example, 6,8, 10 is also a Pythagorian Triple but it is a multiple of 3,4,5...

## Comments

## Leave a comment