On the generation of Heronian triangles
classification
🧮 math.NT
keywords
heroniantrianglesgenerationintegeralgorithmsapplycompletedescribe
read the original abstract
We describe several algorithms for the generation of integer Heronian triangles with diameter at most $n$. Two of them have running time $\mathcal{O}\left(n^{2+\varepsilon}\right)$. We enumerate all integer Heronian triangles for $n\le 600000$ and apply the complete list on some related problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.