On the Generation of Heronian Triangles
DOI:
https://doi.org/10.55630/sjc.2008.2.181-196Keywords:
Heron Triangles, System of Diophantine Equations, Triangles with Rational Area, Perfect PyramidsAbstract
We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O(n^(2+ε)). We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.