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
Doubling the cube at solving what they saw as an obstinate but soluble problem. However, the nonexistence of a solution was finally proven by Pierre Wantzel in 1837. In algebraic terms, doubling a unit cube requires the construction of a line segment of length , where ; in other words, . This is because a cube of side length 1 has a volume of , and a cube of twice that volume (a volume of 2) has a side length of the cube root of 2. The impossibility of doubling the cube is therefore equivalent to the statement that is not a constructible