On the Generation of Heronian Triangles

Sascha Kurz


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.


Heron Triangles; System of Diophantine Equations; System of Diophantine Equations; Triangles with Rational Area; Perfect Pyramids

Full Text: PDF


  • There are currently no refbacks.

ISSN 1314-7897 - Online
ISSN 1312-6555 - Print