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
Reuleaux triangle one draws a third circle, again of the same radius, with its center at one of the two crossing points of the two previous circles, passing through both marked points. The central region in the resulting arrangement of three circles will be a Reuleaux triangle. Alternatively, a Reuleaux triangle may be constructed from an equilateral triangle "T" by drawing three arcs of circles, each centered at one vertex of "T" and connecting the other two vertices. Or, equivalently, it may be constructed as the intersection of three disks centered at the vertices of "T", with radius equal to the side