Name these sets of integers that can be the side lengths of a right triangle.
Each of these entities has a product divisible by 60, and primitive examples contain exactly one multiple of five. One method to generate them involves finding numbers whose product is half of a perfect square, and a method named for Euclid uses the difference of two squares and the sum of the same two squares. These sets always have an even sum, and their existence makes it necessary to include the requirement that n be greater than two in Fermat's [fair-mah'z]  last theorem. In any one of these sets all three numbers must be integers, even though the equation they satisfy often gives an irrational third value when the first two are integers. Name these sets of integers that can be the side lengths of a right triangle.
Each of these entities has a product divisible by 60, and primitive examples contain exactly one multiple of five.
Pythagorean triple(t)s