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
Triangle (in fact, this formula holds for "all" tangential polygons), and where formula_59 are the radii of the excircles tangent to sides "a, b, c" respectively. We also have and for circumdiameter "D"; and for angle α ≠ 90°. The area can also be expressed as In 1885, Baker gave a collection of over a hundred distinct area formulas for the triangle. These include: for circumradius (radius of the circumcircle) "R", and The area "T" of any triangle with perimeter "p" satisfies with equality holding if and only if the triangle is equilateral. Other upper bounds on the area "T" are