On the generation of Heronian triangles
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2014
- DOI:
- 10.48550/arXiv.1401.6150
- arXiv:
- arXiv:1401.6150
- Bibcode:
- 2014arXiv1401.6150K
- Keywords:
-
- Mathematics - Number Theory;
- 11Y50;
- 11D09;
- 11Y16;
- 51M04;
- 51M25
- E-Print:
- 10 pages, 2 figures, 2 tables. http://sci-gems.math.bas.bg/jspui/handle/10525/382