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
Equiangular polygon Equiangular polygon In Euclidean geometry, an equiangular polygon is a polygon whose vertex angles are equal. If the lengths of the sides are also equal (that is, if it is also equilateral) then it is a regular polygon. Isogonal polygons are equiangular polygons which alternate two edge lengths. The only equiangular triangle is the equilateral triangle. Rectangles, including the square, are the only equiangular quadrilaterals (four-sided figures). For a convex equiangular "n"-gon each internal angle is 180(1-2/n)°; this is the "equiangular polygon theorem". Viviani's theorem holds for equiangular polygons: A rectangle (equiangular quadrilateral) with integer side lengths may be tiled