Integer triangle common divisor. Integer triangles with a 60° angle can also be generated by with coprime integers "m", "n" with 0 < "n" < "m" (the angle of 60° is opposite to the side of length "a"). From here, all primitive solutions can be obtained by dividing "a", "b", and "c" by their greatest common divisor (e.g. an equilateral triangle solution is obtained by taking "m" = 2 and "n" = 1, but this produces "a" = "b" = "c" = 3, which is not a primitive solution). See also More precisely, If formula_109, then formula_110, otherwise formula_111. Two different pairs
Equilateral triangle to the points where the angle bisectors of ∠"APB", ∠"BPC", and ∠"CPA" cross the sides ("A", "B", and "C" being the vertices). For any point P in the plane, with distances "p", "q", and "t" from the vertices A, B, and C respectively, For any point P on the inscribed circle of an equilateral triangle, with distances "p", "q", and "t" from the vertices, and For any point P on the minor arc BC of the circumcircle, with distances "p", "q", and "t" from A, B, and C respectively, and moreover, if point D on side BC divides PA into