Recursive generation of primitive Pythagorean triples
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 510636
- A special matrix transformation semigroup of primitive pairs and the genealogy of Pythagorean triples.
- Pythagorean triples. III: Systematic generation of primitive Pythagorean triples by the topological index and caterpillar graphs
- scientific article; zbMATH DE number 5272032
- The group of primitive Pythagorean triples and perplex numbers
Cited in
(13)- Generating Pythagorean triples of a given height
- Modified Farey trees and Pythagorean triples
- Pythagorean triples. III: Systematic generation of primitive Pythagorean triples by the topological index and caterpillar graphs
- Matrix Generation of Pythagorean n-Tuples
- The dynamics of Pythagorean Triples
- scientific article; zbMATH DE number 3819824 (Why is no real title available?)
- scientific article; zbMATH DE number 510636 (Why is no real title available?)
- scientific article; zbMATH DE number 1079130 (Why is no real title available?)
- scientific article; zbMATH DE number 6862175 (Why is no real title available?)
- Analysis of the two-fraction method for generating primitive Pythagoras triples
- Rethinking Pythagorean triples
- Recursive Enumeration of Pythagorean Triples
- A special matrix transformation semigroup of primitive pairs and the genealogy of Pythagorean triples.
This page was built for publication: Recursive generation of primitive Pythagorean triples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312698)
