I'm not really going to post code or ask for code but rather ask for anyones thought on how the pseudocode should go for this problem: Pythagorean Triples: 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 sum of the squares of two of the sides is equal to the square of the hypotenuse. Find all _unique_ Pythagorean triples for side1, side2 and hypotenuse, all no longer than 500. How many are there? Note that this problem specifically asks you to exclude the duplicates. For example, if you were to check all unique Pythagorean Triples less than 5 (rather than 500) your output must be 3 4 5 That is, it must NOT output both (3,4,5) and (4,3,5). my thought: im pretty sure there needs to be multiple for (or while, whatever) loops for this but im not sure how to go about this problem. i figure the outter loop would have to incriment from 1 to 500 and incorporate the Pythagorean theorem. can anyone give me some insight, again, not asking for code, jsut ideas.