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
Isosceles triangle to provide a solution. Although originally formulated only for internal angle bisectors, it works for many (but not all) cases when, instead, two external angle bisectors are equal. The 30-30-120 isosceles triangle makes a boundary case for this variation of the theorem, as it has four equal angle bisectors (two internal, two external). The inradius and circumradius formulas for an isosceles triangle may be derived from their formulas for arbitrary triangles. The radius of the inscribed circle of an isosceles triangle with side length formula_2, base formula_3, and height formula_1 is: The center of the circle lies on the symmetry