On the Generation of Heronian Triangles
| Data(s) |
18/09/2009
18/09/2009
2008
|
|---|---|
| Resumo |
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. |
| Identificador |
Serdica Journal of Computing, Vol. 2, No 2, (2008), 181p-196p 1312-6555 |
| Idioma(s) |
en |
| Publicador |
Institute of Mathematics and Informatics Bulgarian Academy of Sciences |
| Palavras-Chave | #Heron Triangles #System of Diophantine Equations #System of Diophantine Equations #Triangles with Rational Area #Perfect Pyramids |
| Tipo |
Article |
