Input any value Q (Q+1 is the maximum z+n) Output is a list of all Pythagorean Triples (sets of 3 whole numbers that satisfy the Pythagorean Theorem) catalogued by a whole-number coordinate (z,n)
See if you can find a set of Triples a,b,c where each is two digits, and c is equal to a with its digits swapped. I haven't been able to find it, but supposedly it exists?
