This is the problem I need to solve. It comes directly out of a C++ Programming book:

A right triangle can have sides that are all integers. A set of three integer values for the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy the relationship that the sume of the squares of two of the sides equal to the square of the hypotenuse. Find all Pythagorean triples for Side1, side2, and hypotenuse all no larger than 500. Use a triple nested loop that tries all possibilities.

Any help would be much appreciated.... I am fully halted on this problem.