Cube root can be done with a compass-and-straightedge construction. Newton's method is an iterative method that can be used to calculate the cube root. For real floating-point numbers this method reduces to the following iterative algorithm to produce successively better approximations of the cube root of "a": The method is simply averaging three factors chosen such that at each iteration. Halley's method improves upon this with an algorithm that converges more quickly with each step, albeit consuming more multiplication operations: With either method a poor initial approximation of "x" can give very poor algorithm performance, and coming up with a good initial
Nth root real number is a positive real number, negative numbers do not have real square roots. However, for every negative real number there are two imaginary square roots. For example, the square roots of −25 are 5"i" and −5"i", where "i" represents a number whose square is . A cube root of a number "x" is a number "r" whose cube is "x": Every real number "x" has exactly one real cube root, written formula_4. For example, Every real number has two additional complex cube roots. Expressing the degree of an "n"th root in its exponent form, as in formula_37, makes