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 function of the upper half plane. To see how to handle the case when an angle of Δ is a right angle, note that the inequality implies that if one of the angles is a right angle, say "a" = 2, then both "b" and "c" are greater than 2 and one of them, "b" say, must be greater than 3. In this case, reflecting the triangle across the side AB gives an isosceles hyperbolic triangle with angles /"c", /"c" and 2/"b". If 2/"b" ≤ /3, i.e. "b" is greater than 5, then all the angles of the doubled triangle are