Recursive generation of primitive Pythagorean triples
It is shown that all primitive Pythagorean triples can be generated from (0,1,1) by repeated application of the linear transformations \(A=\left[\begin{matrix} 2 &1 &2\\ 1 &2 &2\\ 2 &2 &3\end{matrix}\right]\) for \(A^{-1}\), where eventually some signs must be changed.
scientific article; zbMATH DE number 495246