Kurz, Sascha (2008)
Serdica Journal of Computing
Similarity:
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.
Kurz, Sascha (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Bremner, Andrew (2006)
Annales Mathematicae et Informaticae
Similarity:
Ionascu, Eugen J. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Lócsi, Levente (2009)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Broughton, S.Allen, Haney, Dawn M., McKeough, Lori T., Smith Mayfield, Brandy (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Petulante, Nelson, Kaja, Ifeoma (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Predrag S. Stanimirović, Predrag V. Krtolica, Rade Stanojević (2003)
The Yugoslav Journal of Operations Research
Similarity:
Rusin, David J. (1998)
The New York Journal of Mathematics [electronic only]
Similarity:
Čerin, Zvonko (2000)
Mathematica Pannonica
Similarity:
Judita Cofman (1998)
The Teaching of Mathematics
Similarity:
Andrew Bremner, Joseph R. Goggins, Michael J.T. Guy, Richard K. Guy (2000)
Acta Arithmetica
Similarity:
Miguel de Guzmán (2001)
RACSAM
Similarity:
A simple proof is presented of a famous, and difficult, theorem by Jakob Steiner. By means of a straightforward transformation of the triangle, the proof of the theorem is reduced to the case of the equilateral triangle. Several relations of the Steiner deltoid with the Feuerbach circle and the Morley triangle appear then as obvious.