Root-finding algorithm cubic polynomial may involve non-real cube roots). For polynomials of degree five or higher Abel–Ruffini theorem asserts that there is, in general, no radical expression of the roots. So, except for very low degrees, root finding of polynomials consists of finding approximations of the roots. By the fundamental theorem of algebra, one knows that a polynomial of degree has at most real or complex roots, and the this number is reached for almost all polynomials. It follows that the problem of root finding for polynomials may be split in three different subproblems; For finding one root, Newton's method and other
Principal root of unity Principal root of unity In mathematics, a principal "n"-th root of unity (where "n" is a positive integer) of a ring is an element formula_1 satisfying the equations In an integral domain, every primitive "n"-th root of unity is also a principal formula_3-th root of unity. In any ring, if formula_3 is a power of formula_5, then any formula_6-th root of formula_7 is a principal formula_3-th root of unity. A non-example is formula_9 in the ring of integers modulo formula_10; while formula_11 and thus formula_9 is a cube root of unity, formula_13 meaning that it is not a "principal" cube