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
Schwarz triangle of the reciprocals of these integers: This is simply a way of saying that in Euclidean space the interior angles of a triangle sum to , while on a sphere they sum to an angle greater than , and on hyperbolic space they sum to less. A Schwarz triangle is represented graphically by a triangular graph. Each node represents an edge (mirror) of the Schwarz triangle. Each edge is labeled by a rational value corresponding to the reflection order, being π/vertex angle. Order-2 edges represent perpendicular mirrors that can be ignored in this diagram. The Coxeter-Dynkin diagram represents this triangular