I'm writing a program to search for Pythagorean triples, and I want to decrease the search-time as much as possible (obviously).
There's a method that will decrease the search-time drastically, if only it could be proven that no two Pythagorean triples will have the exact product of multiplying their terms.
For example, [3, 4, 5] and [15, 20, 25]. Indeed, 3 x 4 x 5 is not equal to 15 x 20 x 25. But could this be proven for all Pythagorean triples?
Best Answer
According to the comments of the OEIS sequence listing all these products, this is an open problem.