Preview

Chebyshevskii Sbornik

Advanced search

Pythagorean triangles: partitions into series and recalculation algorithm

https://doi.org/10.22405/2226-8383-2026-27-2-158-161

Abstract

Pythagorean triangles, or Pythagorean triples, have been the subject of such extensive popular science literature, including articles from Kvant and Kvantik, that it makes no sense to list all the sources in a bibliography; simply searching for the relevant terms in an online search
engine is sufficient. You can find websites that explicitly list all Pythagorean triangles in which the hypotenuse does not exceed a certain large number, such as 1,000,000. Each publication, along with well-known facts for centuries, highlights new developments and intriguing numerical details.
Below, we propose one possible algorithm for enumerating all irreducible Pythagorean triangles, which boils down to dividing them into series, each with its own invariant.

About the Author

Dmitry Vladimirovich Georgievsky
Lomonosov Moscow State University
Russian Federation

doctor of physical and mathematical sciences, professor, corresponding member of the Russian Academy of Sciences



References

1. Vinogradov, I.M. 1952, Fundamentals of number theory, Gostekhizdat, Moscow-Leningrad, 180 p.

2. Mitkin, D.A. 2005, “On rational triangles and equihedral rational tetrahedra”, Chebyshevskii Sbornik, vol. 6, no. 3, pp. 113–122.


Review

For citations:


Georgievsky D.V. Pythagorean triangles: partitions into series and recalculation algorithm. Chebyshevskii Sbornik. 2026;27(2):158-161. (In Russ.) https://doi.org/10.22405/2226-8383-2026-27-2-158-161

Views: 37

JATS XML


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2226-8383 (Print)