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 the location of "P". Pompeiu's theorem states that, if "P" is an arbitrary point in an equilateral triangle "ABC", then there exists a triangle with sides of lengths "PA", "PB", and "PC". That is, "PA", "PB", and "PC" satisfy the triangle inequality that any two of them sum to at least as great as the third. By Euler's inequality, the equilateral triangle has the smallest ratio "R"/"r" of the circumradius to the inradius of any triangle: specifically, "R"/"r" = 2. The triangle of largest area of all those inscribed in a given circle is equilateral; and the triangle of smallest