Recent from talks
Nothing was collected or created yet.
Nth root
View on Wikipedia
This article needs additional citations for verification. (October 2022) |
In mathematics, an nth root of a number x is a number r which, when raised to the power of n, yields x:
The positive integer n is called the index or degree, and the number x of which the root is taken is the radicand. A root of degree 2 is called a square root and a root of degree 3, a cube root. Roots of higher degree are referred by using ordinal numbers, as in fourth root, twentieth root, etc. The computation of an nth root is a root extraction.
For example, 3 is a square root of 9, since 32 = 9, and −3 is also a square root of 9, since (−3)2 = 9.
The nth root of x is written as using the radical symbol . The square root is usually written as , with the degree omitted. Taking the nth root of a number, for fixed , is the inverse of raising a number to the nth power,[1] and can be written as a fractional exponent:
For a positive real number x, denotes the positive square root of x and denotes the positive real nth root. A negative real number −x has no real-valued square roots, but when x is treated as a complex number it has two imaginary square roots, and , where i is the imaginary unit.
In general, any non-zero complex number has n distinct complex-valued nth roots, equally distributed around a complex circle of constant absolute value. (The nth root of 0 is zero with multiplicity n, and this circle degenerates to a point.) Extracting the nth roots of a complex number x can thus be taken to be a multivalued function. By convention the principal value of this function, called the principal root and denoted , is taken to be the nth root with the greatest real part and in the special case when x is a negative real number, the one with a positive imaginary part. The principal root of a positive real number is thus also a positive real number. As a function, the principal root is continuous in the whole complex plane, except along the negative real axis.
An unresolved root, especially one using the radical symbol, is sometimes referred to as a surd[2] or a radical.[3] Any expression containing a radical, whether it is a square root, a cube root, or a higher root, is called a radical expression, and if it contains no transcendental functions or transcendental numbers it is called an algebraic expression.
| Arithmetic operations | ||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||
Roots are used for determining the radius of convergence of a power series with the root test. The nth roots of 1 are called roots of unity and play a fundamental role in various areas of mathematics, such as number theory, theory of equations, and Fourier transform.
History
[edit]Definition and notation
[edit]
none of which are real

one of which is a negative real
An nth root of a number x, where n is a positive integer, is any of the n real or complex numbers r whose nth power is x:
Every positive real number x has a single positive nth root, called the principal nth root, which is written . For n equal to 2 this is called the principal square root and the n is omitted. The nth root can also be represented using exponentiation as x1/n.
For even values of n, positive numbers also have a negative nth root, while negative numbers do not have a real nth root. For odd values of n, every negative number x has a real negative nth root. For example, −2 has a real 5th root, but −2 does not have any real 6th roots.
Every non-zero number x, real or complex, has n different complex number nth roots. (In the case x is real, this count includes any real nth roots.) The only complex root of 0 is 0.
The nth roots of almost all numbers (all integers except the nth powers, and all rationals except the quotients of two nth powers) are irrational. For example,
All nth roots of rational numbers are algebraic numbers, and all nth roots of integers are algebraic integers.
The term "surd" traces back to Al-Khwarizmi (c. 825), who referred to rational and irrational numbers as "audible" and "inaudible", respectively. This later led to the Arabic word أصم (asamm, meaning "deaf" or "dumb") for "irrational number" being translated into Latin as surdus (meaning "deaf" or "mute"). Gerard of Cremona (c. 1150), Fibonacci (1202), and then Robert Recorde (1551) all used the term to refer to "unresolved irrational roots", that is, expressions of the form , in which and are integer numerals and the whole expression denotes an irrational number.[6] Irrational numbers of the form where is rational, are called "pure quadratic surds"; irrational numbers of the form , where and are rational, are called mixed quadratic surds.[7]
Square roots
[edit]
A square root of a number x is a number r which, when squared, becomes x:
Every positive real number has two square roots, one positive and one negative. For example, the two square roots of 25 are 5 and −5. The positive square root is also known as the principal square root, and is denoted with a radical sign:
Since the square of every real number is nonnegative, 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 5i and −5i, where i represents a number whose square is −1.
Cube roots
[edit]
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 . For example,
Every real number has two additional complex cube roots.
Identities and properties
[edit]Expressing the degree of an nth root in its exponent form, as in , makes it easier to manipulate powers and roots. If is a non-negative real number,
Every non-negative number has exactly one non-negative real nth root, and so the rules for operations with surds involving non-negative radicands and are straightforward within the real numbers:
Subtleties can occur when taking the nth roots of negative or complex numbers. For instance:
but, rather,
Since the rule strictly holds for non-negative real radicands only, its application leads to the inequality in the first step above.
Simplified form of a radical expression
[edit]A non-nested radical expression is said to be in simplified form if no factor of the radicand can be written as a power greater than or equal to the index; there are no fractions inside the radical sign; and there are no radicals in the denominator.[8]
For example, to write the radical expression in simplified form, we can proceed as follows. First, look for a perfect square under the square root sign and remove it:
Next, there is a fraction under the radical sign, which we change as follows:
Finally, we remove the radical from the denominator as follows:
When there is a denominator involving surds it is always possible to find a factor to multiply both numerator and denominator by to simplify the expression.[9][10] For instance using the factorization of the sum of two cubes:
Simplifying radical expressions involving nested radicals can be quite difficult. In particular, denesting is not always possible, and when possible, it may involve advanced Galois theory. Moreover, when complete denesting is impossible, there is no general canonical form such that the equality of two numbers can be tested by simply looking at their canonical expressions.
For example, it is not obvious that
The above can be derived through:
Let , with p and q coprime and positive integers. Then is rational if and only if both and are integers, which means that both p and q are nth powers of some integer.
Infinite series
[edit]The radical or root may be represented by the infinite series:
with . This expression can be derived from the binomial series.[citation needed]
Computing principal roots
[edit]Using Newton's method
[edit]The nth root of a number A can be computed with Newton's method, which starts with an initial guess x0 and then iterates using the recurrence relation
until the desired precision is reached. For computational efficiency, the recurrence relation is commonly rewritten
This allows to have only one exponentiation, and to compute once for all the first factor of each term.
For example, to find the fifth root of 34, we plug in n = 5, A = 34 and x0 = 2 (initial guess). The first 5 iterations are, approximately:
(All correct digits shown.)
The approximation x4 is accurate to 25 decimal places and x5 is good for 51.
Newton's method can be modified to produce various generalized continued fractions for the nth root. For example,
Digit-by-digit calculation of principal roots of decimal (base 10) numbers
[edit]
Building on the digit-by-digit calculation of a square root, it can be seen that the formula used there, , or , follows a pattern involving Pascal's triangle. For the nth root of a number is defined as the value of element in row of Pascal's Triangle such that , we can rewrite the expression as . For convenience, call the result of this expression . Using this more general expression, any positive principal root can be computed, digit-by-digit, as follows.
Write the original number in decimal form. The numbers are written similar to the long division algorithm, and, as in long division, the root will be written on the line above. Now separate the digits into groups of digits equating to the root being taken, starting from the decimal point and going both left and right. The decimal point of the root will be above the decimal point of the radicand. One digit of the root will appear above each group of digits of the original number.
Beginning with the left-most group of digits, do the following procedure for each group:
- Starting on the left, bring down the most significant (leftmost) group of digits not yet used (if all the digits have been used, write "0" the number of times required to make a group) and write them to the right of the remainder from the previous step (on the first step, there will be no remainder). In other words, multiply the remainder by and add the digits from the next group. This will be the current value c.
- Find p and x, as follows:
- Let be the part of the root found so far, ignoring any decimal point. (For the first step, and ).
- Determine the greatest digit such that .
- Place the digit as the next digit of the root, i.e., above the group of digits you just brought down. Thus the next p will be the old p times 10 plus x.
- Subtract from to form a new remainder.
- If the remainder is zero and there are no more digits to bring down, then the algorithm has terminated. Otherwise go back to step 1 for another iteration.
Examples
[edit]This section needs editing to comply with Wikipedia's Manual of Style. (April 2022) |
Find the square root of 152.2756.
1 2. 3 4
/
\/ 01 52.27 56 (Results) (Explanations)
01 x = 1 100·1·00·12 + 101·2·01·11 ≤ 1 < 100·1·00·22 + 101·2·01·21
01 y = 1 y = 100·1·00·12 + 101·2·01·11 = 1 + 0 = 1
00 52 x = 2 100·1·10·22 + 101·2·11·21 ≤ 52 < 100·1·10·32 + 101·2·11·31
00 44 y = 44 y = 100·1·10·22 + 101·2·11·21 = 4 + 40 = 44
08 27 x = 3 100·1·120·32 + 101·2·121·31 ≤ 827 < 100·1·120·42 + 101·2·121·41
07 29 y = 729 y = 100·1·120·32 + 101·2·121·31 = 9 + 720 = 729
98 56 x = 4 100·1·1230·42 + 101·2·1231·41 ≤ 9856 < 100·1·1230·52 + 101·2·1231·51
98 56 y = 9856 y = 100·1·1230·42 + 101·2·1231·41 = 16 + 9840 = 9856
00 00
Algorithm terminates: Answer is 12.34
Find the cube root of 4192 truncated to the nearest thousandth.
1 6. 1 2 4
3 /
\/ 004 192.000 000 000 (Results) (Explanations)
004 x = 1 100·1·00·13 + 101·3·01·12 + 102·3·02·11 ≤ 4 < 100·1·00·23 + 101·3·01·22 + 102·3·02·21
001 y = 1 y = 100·1·00·13 + 101·3·01·12 + 102·3·02·11 = 1 + 0 + 0 = 1
003 192 x = 6 100·1·10·63 + 101·3·11·62 + 102·3·12·61 ≤ 3192 < 100·1·10·73 + 101·3·11·72 + 102·3·12·71
003 096 y = 3096 y = 100·1·10·63 + 101·3·11·62 + 102·3·12·61 = 216 + 1,080 + 1,800 = 3,096
096 000 x = 1 100·1·160·13 + 101·3·161·12 + 102·3·162·11 ≤ 96000 < 100·1·160·23 + 101·3·161·22 + 102·3·162·21
077 281 y = 77281 y = 100·1·160·13 + 101·3·161·12 + 102·3·162·11 = 1 + 480 + 76,800 = 77,281
018 719 000 x = 2 100·1·1610·23 + 101·3·1611·22 + 102·3·1612·21 ≤ 18719000 < 100·1·1610·33 + 101·3·1611·32 + 102·3·1612·31
015 571 928 y = 15571928 y = 100·1·1610·23 + 101·3·1611·22 + 102·3·1612·21 = 8 + 19,320 + 15,552,600 = 15,571,928
003 147 072 000 x = 4 100·1·16120·43 + 101·3·16121·42 + 102·3·16122·41 ≤ 3147072000 < 100·1·16120·53 + 101·3·16121·52 + 102·3·16122·51
The desired precision is achieved. The cube root of 4192 is 16.124...
Logarithmic calculation
[edit]The principal nth root of a positive number can be computed using logarithms. Starting from the equation that defines r as an nth root of x, namely 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:
(Note: That formula shows b raised to the power of the result of the division, not b multiplied by the result of the division.)
For the case in which x is negative and n is odd, there is one real root r which is also negative. This can be found by first multiplying both sides of the defining equation by −1 to obtain then proceeding as before to find |r|, and using r = −|r|.
Geometric constructibility
[edit]The ancient Greek mathematicians knew how to use compass and straightedge to construct a length equal to the square root of a given length, when an auxiliary line of unit length is given. In 1837 Pierre Wantzel proved that an nth root of a given length cannot be constructed if n is not a power of 2.[11]
Complex roots
[edit]Every complex number other than 0 has n different nth roots.
Square roots
[edit]
The two square roots of a complex number are always negatives of each other. For example, the square roots of −4 are 2i and −2i, and the square roots of i are
If we express a complex number in polar form, then the square root can be obtained by taking the square root of the radius and halving the angle:
A principal root of a complex number may be chosen in various ways, for example
which introduces a branch cut in the complex plane along the positive real axis with the condition 0 ≤ θ < 2π, or along the negative real axis with −π < θ ≤ π.
Using the first(last) branch cut the principal square root maps to the half plane with non-negative imaginary(real) part. The last branch cut is presupposed in mathematical software like Matlab or Scilab.
Roots of unity
[edit]
The number 1 has n different nth roots in the complex plane, namely
where
These roots are evenly spaced around the unit circle in the complex plane, at angles which are multiples of . For example, the square roots of unity are 1 and −1, and the fourth roots of unity are 1, , −1, and .
nth roots
[edit]
Every complex number has n different nth roots in the complex plane. These are
where η is a single nth root, and 1, ω, ω2, ... ωn−1 are the nth roots of unity. For example, the four different fourth roots of 2 are
In polar form, a single nth root may be found by the formula
Here r is the magnitude (the modulus, also called the absolute value) of the number whose root is to be taken; if the number can be written as a+bi then . Also, is the angle formed as one pivots on the origin counterclockwise from the positive horizontal axis to a ray going from the origin to the number; it has the properties that and
Thus finding nth roots in the complex plane can be segmented into two steps. First, the magnitude of all the nth roots is the nth root of the magnitude of the original number. Second, the angle between the positive horizontal axis and a ray from the origin to one of the nth roots is , where is the angle defined in the same way for the number whose root is being taken. Furthermore, all n of the nth roots are at equally spaced angles from each other.
If n is even, a complex number's nth roots, of which there are an even number, come in additive inverse pairs, so that if a number r1 is one of the nth roots then r2 = −r1 is another. This is because raising the latter's coefficient −1 to the nth power for even n yields 1: that is, (−r1)n = (−1)n × r1n = r1n.
As with square roots, the formula above does not define a continuous function over the entire complex plane, but instead has a branch cut at points where θ / n is discontinuous.
Solving polynomials
[edit]It was once conjectured that all polynomial equations could be solved algebraically (that is, that all roots of a polynomial could be expressed in terms of a finite number of radicals and elementary operations). However, while this is true for third degree polynomials (cubics) and fourth degree polynomials (quartics), the Abel–Ruffini theorem (1824) shows that this is not true in general when the degree is 5 or greater. For example, the solutions of the equation
cannot be expressed in terms of radicals. (cf. quintic equation)
Proof of irrationality for non-perfect nth power x
[edit]Assume that is rational. That is, it can be reduced to a fraction , where a and b are integers without a common factor.
This means that .
Since x is an integer, and must share a common factor if . This means that if , is not in simplest form. Thus b should equal 1.
Since and , .
This means that and thus, . This implies that is an integer. Since x is not a perfect nth power, this is impossible. Thus is irrational.
See also
[edit]References
[edit]- ^ "Lesson Explainer: nth Roots: Integers". Retrieved 22 July 2023.
- ^ Bansal, R.K. (2006). New Approach to CBSE Mathematics IX. Laxmi Publications. p. 25. ISBN 978-81-318-0013-3.
- ^ Silver, Howard A. (1986). Algebra and trigonometry. Englewood Cliffs, New Jersey: Prentice-Hall. ISBN 978-0-13-021270-2.
- ^ "Definition of RADICATION". www.merriam-webster.com.
- ^ "radication – Definition of radication in English by Oxford Dictionaries". Oxford Dictionaries. Archived from the original on April 3, 2018.
- ^ Miller, Jeff. "Earliest Known Uses of Some of the Words of Mathematics". Mathematics Pages. Retrieved 2008-11-30.
- ^ Hardy, G. H. (1921). A Course of Pure Mathematics (3rd ed.). Cambridge. §1.13 "Quadratic Surds" – §1.14, pp. 19–23.
- ^ McKeague, Charles P. (2011). Elementary algebra. Cengage Learning. p. 470. ISBN 978-0-8400-6421-9.
- ^ Caviness, B. F.; Fateman, R. J. "Simplification of Radical Expressions" (PDF). Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation. p. 329.
- ^ Richard, Zippel (1985). "Simplification of Expressions Involving Radicals". Journal of Symbolic Computation. 1 (189–210): 189–210. doi:10.1016/S0747-7171(85)80014-6.
- ^ Wantzel, M. L. (1837). "Recherches sur les moyens de reconnaître si un Problème de Géométrie peut se résoudre avec la règle et le compas". Journal de Mathématiques Pures et Appliquées. 1 (2): 366–372.
External links
[edit]Nth root
View on GrokipediaDefinition and Notation
General Definition
In mathematics, for a real number and an integer , the principal nth root of is defined as the unique non-negative real number such that .[7] This principal root represents the primary real solution emphasized in real analysis and algebra, ensuring a consistent non-negative value for non-negative inputs.[7] For , the equation has exactly one positive real solution , which is the principal nth root; for even , a corresponding negative real solution also exists, but the principal is the positive one. When , the unique solution is , serving as the principal root for any . These properties guarantee existence and uniqueness of the principal root in the non-negative domain.[7][7] For , no real nth root exists if is even, since for all real . However, if is odd, there is exactly one real solution such that . The principal root is distinguished as the positive real value applicable to non-negative , while all roots encompass additional solutions, including negatives for even and positive , or the negative real root for odd and negative .[7][7] This relation is equivalently expressed in exponential form as , where the domain is restricted to for even to ensure real values, and extends to all real for odd .[7]Notation and Conventions
The principal nth root of a number is commonly denoted using radical notation as , where is the index placed above the radical symbol, indicating the degree of the root.[8] This notation extends the square root symbol (where the index is implicitly 2) to higher orders, with the radicand placed under the radical sign.[9] An equivalent form is the exponential notation , which expresses the nth root as a fractional exponent, where the numerator 1 signifies the power and the denominator the root index.[8] Both notations are interchangeable in most mathematical contexts, though radical notation is often preferred for its visual clarity in algebraic expressions, while exponential form facilitates operations involving exponents.[10] By convention, the principal nth root is defined to be nonnegative for even indices when , ensuring a unique real value in the nonnegative domain.[11] For odd indices , the principal root preserves the sign of the radicand, allowing real values for negative ; for instance, \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{-8} = -2.[11] These conventions maintain consistency in real analysis, where even roots of negative numbers are not real, but odd roots extend to the negatives.[12] The radical symbol evolved historically from earlier notations, such as the vinculum (an overbar) used in medieval texts to denote roots, transitioning to the modern elongated "r" form derived from the Latin radix (root) by the 16th century.[13] German mathematician Christoff Rudolff introduced a precursor in 1525, and René Descartes standardized the current radical with its index in 1637, replacing horizontal bars for compactness.[14] In terms of placement, the index is positioned to the left and slightly above the radical's opening arm, with the radicand centered beneath the symbol; for nested radicals, each successive root is enclosed within the previous radicand, as in \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{a + \sqrt{b}}, where the inner square root forms part of the outer cube root's argument.[15] This hierarchical structure ensures unambiguous parsing, with indices applying only to their immediate radicands unless specified otherwise.[15]Special Cases: Square and Cube Roots
The square root of a non-negative real number , denoted or , is the principal (non-negative) real number such that . This equation has two real solutions, and , but the principal root is defined as the positive one for (and zero for ). Geometrically, represents the length of the side of a square with area . For example, , as .[16] The cube root of any real number , denoted \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{x} or , is the unique real number such that . This function is defined for all real , including negatives, where the cube root is negative; for instance, \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{-27} = -3. In the complex numbers, the equation has three roots: one real and two complex that form a conjugate pair. Geometrically, \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{x} corresponds to the edge length of a cube with volume . For example, \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{8} = 2, as .[17]/06%3A_Complex_Numbers/6.03%3A_Roots_of_Complex_Numbers) Unlike higher even-order roots (such as fourth roots), which lack real solutions for negative , square roots provide real solutions only for , while cube roots guarantee a real solution for every real . This distinction arises because even powers preserve the sign of negatives as positive, yielding no real roots, whereas odd powers like cubing allow negative inputs to produce negative outputs./09%3A_Roots_and_Radicals/9.07%3A_Higher_Roots)Properties and Identities
Basic Algebraic Properties
The principal nth root function, denoted for , satisfies several fundamental algebraic properties when restricted to real numbers, particularly for the principal (nonnegative) branch. One key property is the product rule: for , .[8][18] This holds for even where roots are defined only for nonnegative arguments, and extends to all real for odd , where can be negative if . Similarly, the quotient rule states that for and appropriate signs, , with the same domain restrictions: for even , or any real (with ) for odd .[8][18] Another essential relation is the power rule, which connects roots to exponents: for integer and (or any real if is odd), .[8][18] This identity assumes the principal root, ensuring the result remains real and nonnegative when applicable. However, care must be taken with negative bases: for even , is undefined in the reals if , while for odd , it is defined and negative, preserving the rules but requiring consistent handling of signs in products or quotients.[8][18] The nth root function also exhibits monotonicity, which underpins inequalities involving roots. Specifically, for , , reflecting its strictly increasing nature on the positive reals regardless of whether is even or odd.[18] For odd , this extends to all reals, where the function is strictly increasing overall. These properties facilitate algebraic manipulations but are valid only under the specified conditions to avoid complex values or inconsistencies in the real domain.[8][18]Relation to Exponents
The nth root of a positive real number , denoted , is mathematically equivalent to , where is a positive integer greater than 1. This representation treats the root extraction as the inverse operation of raising to the nth power, aligning radicals with the broader framework of exponentiation.[8] The equivalence holds for the principal (positive) real root when , and it facilitates the use of exponent properties in algebraic manipulations involving roots.[1] This connection extends naturally to rational exponents. For positive integers and with , the expression can be interpreted as or , providing a consistent way to handle fractional powers through roots. The relation's consistency is verified by the exponent multiplication rule: , and conversely, . These identities confirm that exponentiation and root extraction are mutual inverses for positive and integer . The concept generalizes to real exponents beyond rationals. For and any real number , is defined as , where is the exponential function and is the natural logarithm; here, the nth root appears as the specific case . This exponential-logarithmic definition ensures continuity and differentiability for real exponents, with roots serving as a foundational special case.[8] For non-integer exponents, including fractional and irrational ones, the domain is restricted to to keep defined in the reals and to circumvent issues with negative or zero bases, such as non-real results or undefined expressions.Identities Involving Multiple Roots
One key identity involving multiple roots is that for nested radicals. For positive real numbers and positive integers and , the expression simplifies to . This follows directly from the definition of roots as exponents, where and then .[10] A related identity concerns the change of index for powers within roots. For positive real and nonnegative integer , . Both sides equal , allowing simplification of radical expressions by adjusting the index and exponent, particularly when is a multiple of to eliminate the root entirely if is a perfect power.[9] Sums of nth roots, such as for distinct positive and , generally lack a simple closed-form expression in terms of elementary functions. Such sums are rarely rational unless , and their algebraic structure often requires considering minimal polynomials of higher degree.[19] However, identities exist for rationalizing expressions involving sums or differences of roots, extending the conjugate method. For square roots (), the difference of squares gives , which rationalizes denominators like by multiplying numerator and denominator by the conjugate .[20] For cube roots (), (\sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{a} + \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{b})(\sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{a^2} - \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{ab} + \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{b^2}) = a + b, allowing rationalization of 1/(\sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{a} + \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{b}). In general, for nth roots, the rationalizing factor for is the polynomial , derived from the identity , where is that sum.[21]Radical Expressions and Simplification
Forms of Radical Expressions
Radical expressions represent nth roots using the radical symbol, denoted as , where is the index indicating the degree of the root and is the radicand.[22] For simple radicals, this takes the form , where is an integer coefficient and is an integer exponent on the variable , allowing the expression to capture basic polynomial terms under the root.[22] When the index is omitted, the radical defaults to a square root, equivalent to an index of 2, as in for \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=2&&&citation_type=wikipedia}}{a}.[22] This convention simplifies notation for the most common case while requiring explicit indices for higher-order roots, such as cube roots (\sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{a}) or fourth roots (\sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=4&&&citation_type=wikipedia}}{a}).[22] Nested radicals extend this by embedding one radical within another, typically in forms like , where each successive radicand includes the prior radical expression.[15] These can involve the same index throughout or vary, but the structure emphasizes the hierarchical nesting without specifying evaluation.[15] Canonical forms of radical expressions often rewrite them using rational exponents for algebraic manipulation, such that , converting the radical notation directly to exponential form while preserving the principal root.[22] This equivalence applies similarly to simple and nested radicals, enabling consistent representation across different mathematical contexts.[22]Techniques for Simplification
Simplification of nth root expressions begins with factoring out perfect nth powers from the radicand. For an expression of the form , where is divisible by , it simplifies to , assuming and for real numbers.[22] This process extends the product rule for radicals, , by identifying factors that are perfect nth powers.[23] A systematic algorithm for this simplification relies on prime factorization of the radicand. First, decompose the radicand into its prime factors; then, for each prime with exponent in the factorization, extract groups of factors by reducing the exponent by multiples of , placing the extracted base outside the root. For instance, in \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{54} = \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{2 \cdot 3^3} = 3 \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{2}, using the full factorization . This method ensures the radicand has no perfect nth power factors greater than 1, achieving simplest form where all exponents in the prime factorization are less than .[24] Denesting radicals removes nested roots by expressing them as sums or differences of simpler roots. For square roots, an expression denests to when , derived from squaring the right-hand side to match the left.[25] More generally, denests to . This technique applies when the nested radical satisfies a quadratic equation with rational coefficients, allowing resolution via the quadratic formula.[26] Denesting of cube roots is more complex and typically applies to expressions like \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{a + b \sqrt{{grok:render&&&type=render_inline_citation&&&citation_id=3&&&citation_type=wikipedia}}{c}} under conditions where the minimal polynomial allows resolution by radicals of degree at most 3. Not all nested cube roots denest over the rationals; denestability depends on the minimal polynomial's degree and field extensions, with algorithms checking solvability by radicals.[27] Rationalizing denominators eliminates roots from the bottom of fractions. For a denominator with a single nth root, such as , multiply numerator and denominator by to yield . For square roots, the conjugate is used when the denominator is , as . For higher roots, the full set of conjugates or powers up to may be needed, though this generalizes the process for binomials.[28] This ensures the denominator is rational while preserving the expression's value.[29]Computation of Principal Roots
Numerical Iterative Methods
Numerical iterative methods provide efficient ways to approximate the principal nth root of a positive real number x, denoted as , by solving the equation for y > 0. One of the most widely used approaches is Newton's method, a root-finding algorithm that generates successively better approximations through an iterative process.[30] To apply Newton's method, consider the function , where the goal is to find the root such that . The derivative is , leading to the iteration formula: This update rule refines the estimate starting from an initial guess . For values of x near 1, a simple initial guess is , which often suffices for rapid convergence.[31] Under suitable conditions, such as a sufficiently close initial guess and smoothness of f near the root, Newton's method exhibits quadratic convergence, meaning the number of correct digits roughly doubles with each iteration. This property makes it particularly effective for high-precision computations once the approximation is reasonably accurate.[30] For example, to approximate (the case n=2), start with . The first iteration yields . The second gives , and the third , converging quickly to the true value ≈1.414213562.[32] The method's advantages include its rapid convergence on modern computers, enabling high accuracy in few steps, and its adaptability to large n or arbitrary-precision arithmetic, as implemented in libraries for integer nth roots.[33][31]Digit-by-Digit Algorithms
Digit-by-digit algorithms provide a manual method for computing the principal nth root of a number in base 10, analogous to the long division process for roots of specific orders like squares and cubes. These methods proceed iteratively, determining one digit of the root at a time by grouping the digits of the radicand into sets of n and testing trial digits against the current remainder using expansions derived from the binomial theorem. The approach ensures each digit is exact before proceeding, making it suitable for pencil-and-paper calculations despite being computationally intensive for higher n.[34] For square roots (n=2), the algorithm begins by pairing the digits of the number from the decimal point, working leftward for the integer part and rightward for the fractional part. If the number of digits is odd, the leftmost group has one digit. The largest integer whose square is less than or equal to the first group is placed as the first digit of the root; its square is subtracted from the group, leaving a remainder. The next pair of digits is brought down and appended to the remainder. The current root is doubled, and a trial digit d is found such that (20 × current root + d) × d does not exceed the new remainder. This trial value is subtracted, and the process repeats with the doubled root updated to include the new digit. For example, to compute √66564 (5 digits, groups 6 | 65 | 64), the first digit is 2 (2²=4 ≤6), remainder 2; bring down 65 (265), doubled root 4 yields trial d=5 where (40 + 5) × 5 = 225 ≤265, remainder 40; bring down 64 (4064), doubled root 50 yields trial d=8 where (500 + 8) × 8 = 4064 ≤4064, remainder 0, yielding 258 exactly.[35] The method generalizes to arbitrary nth roots by grouping digits into sets of n instead of pairs and using the binomial theorem to evaluate trial multiples efficiently. For a current partial root y (shifted by the base, e.g., ×10 for the next digit), the next digit d (0-9) is the largest integer such that the expansion of (10y + d)^n does not exceed the current remainder after bringing down the next n digits. The full expansion is ∑_{k=0}^n \binom{n}{k} (10y)^{n-k} d^k, but only the terms involving d are computed incrementally for the trial, subtracting the known (10y)^n from the previous remainder. This requires precomputing or calculating binomial coefficients for each step, increasing complexity with n but allowing sequential digit extraction. Historical formulations, such as those by Al-Kashi in 1427, formalized this iterative process for higher roots using similar cycle groupings and polynomial evaluations.[34][36] As an illustration for cube roots (n=3), consider computing ∛208 to two decimal places. Group as 208 | 000 | 000. The largest integer A with A³ ≤208 is 5 (125), remainder 83. Bring down 000 to get 83000; current root 5, scaled to 50 for the next place, test d=9 where 3(50)²(9) + 3(50)(9)² + 9³ = 67500 + 12150 + 729 = 80379 ≤83000, subtract to remainder 2621. Bring down 000 to 2621000; updated root 59, scaled to 590, test d=2 where 3(590)²(2) + 3(590)(2)² + 2³ = 2088600 + 7080 + 8 = 2095688 ≤2621000, subtract to remainder 525312. Thus, ∛208 ≈5.92 (verifiable as 5.92³ ≈207.59, close to 208). This process can continue for more digits.[37]Series Expansions and Approximations
One effective method for approximating nth roots involves the binomial series expansion, which is particularly useful for values close to 1. For a real number with and positive integer , the function can be expanded as an infinite series: where the generalized binomial coefficient is defined as for , and .[38] This series converges absolutely within the unit disk , providing a rapid approximation when truncating after a finite number of terms; the error after terms is bounded by the next term in the alternating series for appropriate , or more generally by the remainder term in the binomial expansion.[38] To apply this to the principal nth root for near a perfect nth power, select an integer such that . Then rewrite where with . This r < 1 only if the interval length relative to a^n is <1, which holds for large a but not always (e.g., small a or x near (a+1)^n). For |r| ≥ 1, choose a closer approximation or use alternative methods to ensure convergence. Substituting the binomial series yields an approximation for by computing the first few terms, with convergence guaranteed by the radius of 1 in . For example, approximating the cube root of 10 uses since , so , and the series provides terms like , close to the true value of approximately 2.15443.[38] A more general approach uses the Taylor series expansion of around a point , which approximates for near : where the kth derivative is , so at , Thus, the series is This converges for , as the radius of convergence is the distance to the nearest singularity at y = 0, the branch point of the nth root function.[39] The Lagrange form of the remainder provides error bounds: after m terms, the error is at most for some between a and y, allowing precise control over approximation accuracy.[39]Geometry and Constructibility
Constructions for Square Roots
Square roots of constructible lengths, such as positive rationals, can be constructed precisely using only a compass and straightedge, forming a cornerstone of Euclidean geometry.[40] This capability stems from the closure of constructible numbers under square root extraction, enabling the building of lengths like as the hypotenuse of a unit square.[41] A primary method employs the geometric mean construction, which produces for given positive lengths and via circle intersection, grounded in Thales' theorem.[42] Thales' theorem asserts that an angle inscribed in a semicircle is a right angle, providing the necessary right triangle for the Pythagorean relation.[43] To adapt this for specifically (setting and ), the steps are as follows:- Draw a straight line segment and mark points and such that .
- Extend from to point such that , making the diameter .
- Construct a semicircle with diameter .
- Erect a perpendicular to at , intersecting the semicircle at point .
