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
Equilateral pentagon are sufficient to determine a convex equilateral pentagon. Each circle's center is one of four vertices of the pentagon. The remaining vertex is determined by one of the intersection points of the first and the last circle of the chain. It is possible to describe any convex equilateral pentagon with only two angles α and β with α ≥ β provided the fourth angle (δ) is the smallest of the rest of the angles. Thus the general equilateral pentagon can be regarded as a bivariate function "f(α, β)" where the rest of the angles can be obtained by using trigonometric