cube root

In mathematics, a cube root of a number is a number that has the given number as its third power; that is $y^3=x.$ The number of cube roots of a number depends on the number system that is considered.

Every real number has exactly one real cube root that is denoted \sqrt /math> and called the ''real cube root'' of or simply ''the cube root'' of in contexts where complex numbers are not considered. For example, the real cube roots of and are respectively and . The real cube root of an integer or of a rational number is generally not a rational number, neither a constructible number.

Every nonzero real or complex number has exactly three cube roots that are complex numbers. If the number is real, one of the cube roots is real and the two other are nonreal complex conjugate numbers. Otherwise, the three cube roots are all nonreal. For example, the real cube root of is and the other cube roots of are $-1+i\sqrt 3$ and $-1-i\sqrt 3$. The three cube roots of are
$3i, \tfrac-\tfraci,$ and $-\tfrac-\tfraci.$ The number zero has a unique cube root, which is zero itself.

The cube root is a multivalued function. The ''principal cube root'' is its principal value, that is a unique cube root that has been chosen once for all. The principal cube root is the cube root with the largest real part. In the case of negative real numbers, the largest real part is shared by the two nonreal cube roots, and the principal cube root is the one with positive imaginary part. So, for negative real numbers, ''the real cube root is not the principal cube root''. For positive real numbers, the principal cube root is the real cube root.

If is any cube root of the complex number , the other cube roots are $y\, \tfrac$ and $y\, \tfrac.$

In an algebraically closed field of characteristic different from three, every nonzero element has exactly three cube roots, which can be obtained from any of them by multiplying it by either root of the polynomial $x^2+x+1.$ In an algebraically closed field of characteristic three, every element has exactly one cube root.

In other number systems or other algebraic structures, a number or element may have more than three cube roots. For example, in the quaternions, a real number has infinitely many cube roots.

Definition

The cube roots of a number are the numbers which satisfy the equation $y^3 = x.\$

Properties

Real numbers

For any real number , there is exactly one real number such that $y^3=x$. Indeed, the cube function is increasing, so it does not give the same result for two different inputs, and covers all real numbers. In other words, it is a bijection or one-to-one correspondence.

That is, one can define ''the'' cube root of a real number as its unique cube root that is also real. With this definition, the cube root of a negative number is a negative number.

However this definition may be confusing when real numbers are considered as specific complex numbers, since, in this case ''the'' cube root is generally defined as the principal cube root, and the principal cube root of a negative real number is not real.

If and are allowed to be complex, then there are three solutions (if is non-zero) and so has three cube roots. A real number has one real cube root and two further cube roots which form a complex conjugate pair. For instance, the cube roots of 1 are:

:$1, \quad -\frac+\fraci, \quad -\frac-\fraci.$

The last two of these roots lead to a relationship between all roots of any real or complex number. If a number is one cube root of a particular real or complex number, the other two cube roots can be found by multiplying that cube root by one or the other of the two complex cube roots of 1.

Complex numbers

For complex numbers, the principal cube root is usually defined as the cube root that has the greatest real part, or, equivalently, the cube root whose argument has the least absolute value. It is related to the principal value of the natural logarithm by the formula

:$x^ = \exp \left( \frac13 \ln \right).$

If we write as

:$x = r \exp(i \theta)\,$

where is a non-negative real number and $\theta$ lies in the range

:$-\pi < \theta \le \pi$,

then the principal complex cube root is

:\sqrt = \sqrt exp \left(\frac \right).

This means that in polar coordinates, we are taking the cube root of the radius and dividing the polar angle by three in order to define a cube root. With this definition, the principal cube root of a negative number is a complex number, and for instance \sqrt /math> will not be −2, but rather $1+i\sqrt 3$

This difficulty can also be solved by considering the cube root as a multivalued function: if we write the original complex number in three equivalent forms, namely

:x = \begin r \exp (i \theta ), \\ pxr \exp (i \theta + 2i\pi ), \\ pxr \exp ( i \theta - 2i\pi ). \end

The principal complex cube roots of these three forms are then respectively

:\sqrt = \begin
\sqrt exp \left( \frac\right),
\\ \sqrt exp \left(\frac + \frac \right),
\\ \sqrt exp \left(\frac - \frac \right). \end

Unless , these three complex numbers are distinct, even though the three representations of ''x'' were equivalent. For example, \sqrt /math> may then be calculated to be −2, $1+i\sqrt3$, or $1-i\sqrt3$.

This is related with the concept of monodromy: if one follows by continuity the function ''cube root'' along a closed path around zero, after a turn the value of the cube root is multiplied (or divided) by $e^.$

Impossibility of compass-and-straightedge construction

Cube roots arise in the problem of finding an angle whose measure is one third that of a given angle (angle trisection) and in the problem of finding the edge of a cube whose volume is twice that of a cube with a given edge ( doubling the cube). In 1837 Pierre Wantzel proved that neither of these can be done with a compass-and-straightedge construction.

Numerical methods

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 :

:$x_ = \frac \left(\frac + 2x_n\right).$

The method is simply averaging three factors chosen such that
:$x_n \times x_n \times \frac=a$
at each iteration.

Halley's method improves upon this with an algorithm that converges more quickly with each iteration, albeit with more work per iteration:

:$x_ = x_n \left(\frac\right).$

This converges cubically, so two iterations do as much work as three iterations of Newton's method. Each iteration of Newton's method costs two multiplications, one addition and one division, assuming that is precomputed, so three iterations plus the precomputation require seven multiplications, three additions, and three divisions.

Each iteration of Halley's method requires three multiplications, three additions, and one division, so two iterations cost six multiplications, six additions, and two divisions. Thus, Halley's method has the potential to be faster if one division is more expensive than three additions.

With either method a poor initial approximation of can give very poor algorithm performance, and coming up with a good initial 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.

Also useful is this generalized continued fraction, based on the nth root method:

If is a good first approximation to the cube root of and $y=a-x^3$, then:

:\sqrt = \sqrt = x+\cfrac
:$= x+\cfrac .$

The second equation combines each pair of fractions from the first into a single fraction, thus doubling the speed of convergence.

Appearance in solutions of third and fourth degree equations

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 solution expressions involve the real cube root of a real number, while if all three solutions are real numbers then they may be expressed in terms of the complex cube root of a complex number.

Quartic equations can also be solved in terms of cube roots and square roots.

History

The calculation of cube roots can be traced back to Babylonian mathematicians from as early as 1800 BCE. In the fourth century BCE Plato posed the problem of doubling the cube, which required a compass-and-straightedge construction of the edge of a cube with twice the volume of a given cube; this required the construction, now known to be impossible, of the length \sqrt /math>.

A method for extracting cube roots appears in '' The Nine Chapters on the Mathematical Art'', a Chinese mathematical text compiled around the second century BCE and commented on by Liu Hui in the third century CE. The Greek mathematician Hero of Alexandria devised a method for calculating cube roots in the first century CE. His formula is again mentioned by Eutokios in a commentary on Archimedes. In 499 CE Aryabhata, a mathematician-astronomer from the classical age of Indian mathematics and Indian astronomy, gave a method for finding the cube root of numbers having many digits in the ''Aryabhatiya'' (section 2.5).
Aryabhatiya
'', Mohan Apte, Pune, India, Rajhans Publications, 2009, p. 62,

See also

* Methods of computing square roots
* List of polynomial topics
* Nth root
* Square root
* Nested radical
* Root of unity

References

External links

Cube root calculator reduces any number to simplest radical formComputing the Cube Root, Ken Turkowski, Apple Technical Report #KT-32, 1998
Includes C source code.
*

{{DEFAULTSORT:Cube Root
Elementary special functions
Elementary algebra
Unary operations