1 resultado para Perfect Pyramids

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

60.00% 60.00%

Publicador:

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.