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 O(n2+). We enumerate all integer Heronian triangles for n 600000 and apply the complete list on some related problems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.