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 group: Find the square root of 152.2756. Find the cube root of 4192 to the nearest hundredth. The principal "n"th root of a positive number can be computed using logarithms. Starting from the equation that defines "r" as an "n"th root of "x", namely formula_80 with "x" positive and therefore its principal root "r" also positive, one takes logarithms of both sides (any base of the logarithm will do) to obtain The root "r" is recovered from this by taking the antilog: For the case in which "x" is negative and "n" is odd, there is one real root "r"