A characterization of all equilateral triangles in .
Chandler, Ray, Ionascu, Eugen J. (2008)
Integers
Similarity:
Chandler, Ray, Ionascu, Eugen J. (2008)
Integers
Similarity:
Francis, Richard L. (2004)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Wacław Sierpiński
Similarity:
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, Noll, Landon Curt, Rathbun, Randall, Simmons, Chuck (2014)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): G.2, G.4. A set of n lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and coordinates are integers is called an n-cluster (in R^2). We determine the smallest 7-cluster with respect to its diameter. Additionally we provide a toolbox of algorithms which allowed us to computationally locate over 1000 different 7-clusters, some of them having huge integer edge lengths. Along the...
Győry, Kálmán, Smyth, Chris (2010)
Integers
Similarity:
S. Świerczkowski (1959)
Colloquium Mathematicae
Similarity:
Čerin, Z. (1997)
Mathematica Pannonica
Similarity:
Broughton, S.Allen, Haney, Dawn M., McKeough, Lori T., Smith Mayfield, Brandy (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Čerin, Zvonko (2000)
Mathematica Pannonica
Similarity:
Judita Cofman (1998)
The Teaching of Mathematics
Similarity:
Dubner, Harvey, Forbes, Tony (2001)
Journal of Integer Sequences [electronic only]
Similarity: