Angle trisection with coefficients in the field generated by these numbers. Therefore, any number that is constructible by a sequence of steps is a root of a minimal polynomial whose degree is a power of two. Note also that radians (60 degrees, written 60°) is constructible. The argument below shows that it is impossible to construct a 20° angle. This implies that a 60° angle cannot be trisected, and thus that an arbitrary angle cannot be trisected. Denote the set of rational numbers by . If 60° could be trisected, the degree of a minimal polynomial of over would be a power
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