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
Monochromatic triangle G2(V,E2) are triangle-free graphs, and false otherwise. This decision problem is NP-complete. The problem may be generalized to triangle-free edge coloring, finding an assignment of colors to the edges of a graph so that no triangle has all three edges given the same color. The monochromatic triangle problem is the special case of triangle-free edge-coloring when there are exactly two colors available. If there exists a two-color triangle-free edge coloring, then the edges of each color form the two sets E1 and E2 of the monochromatic triangle problem. Conversely, if the monochromatic triangle problem has a solution, we can use