Rational triangles with equal area.
Rusin, David J. (1998)
The New York Journal of Mathematics [electronic only]
Similarity:
Displaying similar documents to “On Heron triangles.”
Rational triangles with equal area.
A note on integral clock triangles.
J. MacLeod, Allan (2008)
Annales Mathematicae et Informaticae
Similarity:
The envelope of the Wallace-Simpson lines of a triangle. A simple proof of the Steiner problem on the deltoid.
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.
On the existence of triangle with given angle and opposite angle bisectors length.
Bukor, József (2008)
Annales Mathematicae et Informaticae
Similarity:
Dividing the Sides of a Triangle in Proportional Parts
Paulus Gerdes (2003)
Visual Mathematics
Similarity:
Hyperbolas and orthologic triangles.
Čerin, Z. (1997)
Mathematica Pannonica
Similarity:
Pascal like triangles and Sierpinski like gaskets
Tomohide Hashiba, Yuta Nakagawa, Toshiyuki Yamauchi, Hiroshi Matsui, Satoshi Hashiba, Daisuke Minematsu, Munetoshi Sakaguchi, Ryohei Miyadera (2007)
Visual Mathematics
Similarity:
Cevians as sides of triangles.
Čerin, Zvonko (2000)
Mathematica Pannonica
Similarity:
Cutting circles and the Morley theorem.
Stammler, Ludwig (1997)
Beiträge zur Algebra und Geometrie
Similarity:
A solution to an “unsolved problem in number theory”.
MacLeod, Allan J. (2003)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
The weighted Fermat triangle problem.
Shen, Yujin, Tolosa, Juan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Constructing 7-Clusters
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...
Points at rational distance from the vertices of a triangle
T. G. Berry (1992)
Acta Arithmetica
Similarity: