Recursive generation of primitive Pythagorean triples (Q1312698)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 495246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursive generation of primitive Pythagorean triples |
scientific article; zbMATH DE number 495246 |
Statements
Recursive generation of primitive Pythagorean triples (English)
0 references
26 April 1994
0 references
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.
0 references
primitive Phythagorean triples
0 references
0.7687478065490723
0 references
0.7648125886917114
0 references
0.7445351481437683
0 references
