Cube root approximation is somewhat of a black art. Some implementations manipulate the exponent bits of the floating-point number; i.e. they arrive at an initial approximation by dividing the exponent by 3. Cubic equations, which are polynomial equations of the third degree (meaning the highest power of the unknown is 3) can always be solved for their three solutions in terms of cube roots and square roots (although simpler expressions only in terms of square roots exist for all three solutions, if at least one of them is a rational number). If two of the solutions are complex numbers, then all three
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