Square root
|
|
In mathematics, the principal square root of a non-negative real number <math>x\,\!<math> is denoted <math>\sqrt x<math> and represents the non-negative real number whose square (the result of multiplying the number by itself) is <math>x\,\!<math>.
For example, <math>\sqrt 9 = 3<math> since 32 = 3 × 3 = 9.
This example suggests how square roots can arise when solving quadratic equations such as <math>x^2=9<math> or, more generally, <math>ax^2+bx+c=0.<math>
There are two solutions to the square root of a non-zero number. For a positive real number, the two square roots are the principle square root and the negative square root. For negative real numbers, the concept of imaginary and complex numbers has been developed to provide a mathematical framework to deal with the results.
Square roots of positive integers are often irrational numbers, i.e., numbers not expressible as a quotient of two integers. For example, <math>\sqrt 2<math> cannot be written exactly as m/n, where n and m are integers. Nonetheless, it is exactly the length of the diagonal of a square with side length 1.
The discovery that <math>\sqrt 2<math> is irrational is attributed to Hippasus, a disciple of Pythagoras.
The square root symbol (√) was first used during the 16th century. It has been suggested that it originated as an altered form of lowercase r, representing the Latin radix (meaning "root").
Properties
- The principal square root function <math>\sqrt{x}<math> is a function which maps the non-negative real domain R+∪{0} into the non-negative real codomain R+∪{0}.
- The principal square root function <math>\sqrt{x}<math> always returns a single unique value.
- There are only two solutions to the equation <math>x = \sqrt{x}<math> The solution set is { 0,1 }.
- To obtain both roots of a positive number, take the value given by the principal square root function as the first root (root1) and obtain the second root (root2) by subtracting the first root from zero (ie root2 = 0 - root1).
- The following important properties of the square root functions are valid for all positive real numbers <math>x<math> and <math>y<math>:
- <math>\sqrt{xy} = \sqrt x \sqrt y \qquad \Rightarrow \qquad \sqrt{100\,y} \, = \, 10 \cdot \sqrt y <math>
- <math>\sqrt{\frac{x}{y}} = \frac{\sqrt{x}}{\sqrt{y}} \qquad \Rightarrow \qquad \sqrt{\left ( \frac{x}{100}\right ) } = \frac{\sqrt{x}}{10} <math>
- <math>\sqrt{x^2} = \left|x\right|<math> for every real number <math>x<math> (see absolute value)
- <math>\sqrt x = x^{1/2} <math>
- The square root function generally maps rational numbers to algebraic numbers; <math>\sqrt x<math> is rational if and only if <math>x<math> is a rational number which, after cancelling, is a ratio of two perfect squares. In particular, <math>\sqrt 2<math> is irrational.
- In geometrical terms, the square root function maps the area of a square to its side length.
- Suppose that <math>x<math> and <math>a<math> are reals, and that <math>x^2 = a<math>, and we want to find <math>x<math>. A common mistake is to "take the square root" and deduce that <math>x = \sqrt a<math>. This is incorrect, because the principal square root of <math>x^2<math> is not <math>x<math>, but the absolute value <math>\left| x \right|<math>, one of our above rules. Thus, all we can conclude is that <math>\left| x \right| = \sqrt a<math>, or equivalently <math>x = \pm\sqrt a<math>.
- In calculus, for instance when proving that the square root function is continuous or differentiable or when computing certain limits, the following identity often comes handy:
- <math>\sqrt x - \sqrt y = \frac{x-y}{\sqrt x + \sqrt y}<math>
- It is valid for all non-negative numbers <math>x<math> and <math>y<math> which are not both zero.
- The function <math>f(x) = \sqrt x<math> has the following graph, made up of half a parabola lying on its side:
- The function is continuous for all non-negative <math>x<math>, and differentiable for all positive <math>x<math> (it is not differentiable for <math>x=0<math> since the slope of the tangent there is ∞). Its derivative is given by
- <math>f'(x) = \frac{1}{2\sqrt x}<math>
- Its Taylor series about <math>x=1<math> can be found using the binomial theorem:
- <math>\sqrt{x+1}=1 +
\sum_{n=1}^\infty { (-1)^{n+1} (2n-2)! \over n! (n-1)! 2^{2n-1} }x^n<math>
- <math> = 1 + \frac{1}{2}x - \frac{1}{8}x^2 + \frac{1}{16} x^3 - \frac{5}{128} x^4 + \dots<math>
- for <math>\left| x \right| < 1<math>.
Common errors involving equations with the principal square root function
- Not recognising <math>x^{1/2}<math> as the principal square root of <math>x<math> in a squaring step followed by principal square root step.
- <math>-1 = -1^1 = -1^{2/2} = (-1^2)^{1/2} = 1^{1/2} = 1\,\!<math>
- In details we have:
- <math>-1=-1^1\,\!<math>
- <math>-1^1=-1^{2/2}\,\!<math>
- <math>-1^{2/2}=\sqrt{-1^2}\qquad\mathbf{Error!}\,\!<math>
- This is because <math>-1^{2/2}=-1\,\!<math> and <math>\sqrt{-1^2}=\sqrt{1}<math> so
- <math>-1\ne\sqrt{1}<math>
- The error comes in taking the principal square root of a square of −1.
- Not taking into account false root(s) when squaring equations with the principal square root function
- <math>x - 1 = \sqrt{x}\,\!<math>
- <math>x^2 - 2x + 1 = x\,\!<math> squaring both sides which introduces the false root x=0.38197
- <math>x^2 - 3x + 1 = 0\,\!<math> move x from the right hand side to the left hand side
- Using the quadratic equation formula, we get the solutions
- <math>x=2.618<math> or <math>x=0.38197<math>
- But when we substitute back <math>x=0.38197<math>
- <math>0.38197 - 1 = \sqrt{0.38197}<math>
- <math>-0.61803 = 0.61803<math> Error!
Computing square roots
Calculators
Pocket calculators typically implement good routines to compute the exponential function and the natural logarithm, and then compute the square root of <math>x<math> using the identity
- <math>\sqrt{x} = e^{\frac{1}{2}\ln x}<math>
The same identity is exploited when computing square roots with logarithm tables or slide rules.
Babylonian method
A commonly used algorithm for approximating <math>\sqrt r<math> is known as the "Babylonian method" and is based on Newton's method. It proceeds as follows:
- start with an arbitrary positive start value <math>x<math> (the closer to the root the better)
- replace <math>x<math> by the average of <math>x<math> and r/x
- go to 2
This is a quadratically convergent algorithm, which means that the number of correct digits of <math>r<math> roughly doubles with each step.
This could be represented as
- <math>x_{n+1} = 0.5 (x_n + \frac{r}{x_n})<math>
where <math>\lim_{n \to \infty} x_n = \sqrt r.<math>
This algorithm works equally well in the p-adic numbers, but cannot be used to identify real square roots with p-adic square roots; it is easy, for example, to construct a sequence of rational numbers by this method which converges to <math>+3<math> in the reals, but to <math>-3<math> in the 2-adics.
Simple approximation
The simple approximation is rather simple and can be highly inaccurate. The amount of inaccuracy for this approximation is dependent on the value of the expression d/2N , the larger the value of this expression, the more inaccurate the value of the approximated result.
Construction
If N > 0 and d > 0 then
- <math> N^2 \quad < \quad N^2 + d \quad < \quad N^2 + 2\,d + \frac{d^2}{N^2}<math>
- <math> N^2 \quad < \quad N^2 + d \quad < \quad N^2 + 2\left( N \right) \left( \frac{d}{N} \right) + \left( \frac{d}{N} \right)^2<math>
- <math> N^2 \quad < \quad N^2 + d \quad < \quad \left( N + \frac{d}{N} \right)^2 <math>
- <math> N \quad < \quad \sqrt{N^2 + d } \quad < \quad N + \frac{d}{N} <math>
So the solution for <math>\sqrt{N^2 + d}<math> must be between <math>(N)<math> and <math>( N + \frac{d}{N})<math>
- <math>\sqrt{N^2 + d} \, \approx \, average ( N , N + \frac{d}{N} ) <math>
- <math>\sqrt{N^2 + d} \, \approx \, \frac{1}{2} \left( N + N + \frac{d}{N} \right) <math>
Thus
- <math>\sqrt{N^2 + d} \, \approx \, N + \frac{d}{2\,N} <math>
Bakhshali approximation
The Bakhshali square root approximation is a mathematical method for finding an approximation to a square root which was described in an ancient manuscript by the name of "The Bakhshali Manuscript" because it was discovered in 1881 near the village of Bakhshali (or Bakhshalai) in the Yusufzai subdivision of the Peshawar district (now part of Pakistan). The manuscript was made out of the leaves of birch bark tree and was written in Sarada script.
The Bakhshali square root approximation is just the simple approximation applied twice.
Let <math>P \,=\, \frac{d}{2 N}<math>
Let <math>A = N + P<math>
<math>\sqrt{N^2 + d} \approx A - \frac{P^2}{2 A} <math>
When expanded, the equation becomes
- <math>\sqrt{N^2 + d} \approx N + \frac{d}{2\,N} - \frac{d^2}{8\,N^3 + 4\,N\,d}<math>
Bakhshali approximation example
Find <math>\sqrt{9.2345}<math>
- Using <math>N=3 \qquad and \qquad d = 9.2345 - 3^2 = 0.2345 <math>
- <math>\sqrt{3^2 + d} \approx 3 + \frac{d}{6} - \frac{d^2}{216 + 12\,d}<math>
- <math>\sqrt{3^2 + 0.2345} \approx 3 + \frac{0.2345}{6} - \frac{0.2345^2}{216 + 12 \cdot 0.2345}<math>
- <math>\sqrt{3^2 + 0.2345} \approx 3 + 0.039083 - \frac{0.055}{216 + 2.814}<math>
- <math>\sqrt{3^2 + 0.2345} \approx 3 + 0.039083 - 0.000251<math>
- <math>\sqrt{3^2 + 0.2345} \approx 3.038832<math>
An exact "long-division like" algorithm
This method, while much slower than the Babylonian method, has the advantage that it is exact: if the given number has a square root whose decimal representation terminates, then the algorithm terminates and produces the correct square root after finitely many steps. It can thus be used to check whether a given integer is a square number.
Write the number in decimal and divide it into pairs of digits starting from the decimal point. The numbers are laid out similar to the long division algorithm and the final square root will appear above the original number.
For each iteration:
- Bring down the most significant pair of digits not yet used and append them to any remainder. This is the current value referred to in steps 2 and 3.
- If <math>s<math> denotes the part of the result found so far, determine the greatest digit <math>x<math> that does not make <math>y = x(20s + x)<math> exceed the current value. Place the new digit <math>x<math> on the quotient line.
- Subtract <math>y<math> from the current value to form a new remainder.
- If the remainder is zero and there are no more digits to bring down the algorithm has terminated. Otherwise continue with step 1.
Example: What is the square root of 152.2756?
1 2. 3 4
| 01 52.27 56 1 The digit 1 is a solution digit
x 01 1(20*0+1)=1 +1
00 52 22 The digit 2 is a solution digit
2x 00 44 2(20*1+2)=44 + 2
08 27 243 The digit 3 is a solution digit
24x 07 29 3(20*12+3)=729 + 3
98 56 2464 The digit 4 is a solution digit
246x 98 56 4(20*123+4)=9856 4
00 00 Algorithm terminates: answer is 12.34
Although demonstrated here for base 10 numbers, the procedure works for
any base, including base 2. In the description above, 20 means double
the number base used, in the case of binary this would really be
100. The algorithm is in fact much easier to perform in base 2, as in every step only the two digits 0 and 1 have to be tested. See Shifting nth-root algorithm.
Rough estimation
Many of the methods used for finding the square root of a number requires an initial seed value which should ideally be close to the actual value of the square root. One way of obtaining a very rough estimate of the value of the square root is as follows.
Provided that r » 1
Steps
- Take the integer part of the number r. Z = int(r)
- Count the number of digits in Z. Let D be the number of digits.
- Calculate the value of 3D.
- The rough estimate is half the value obtained in step 3. E = (3D) / 2
Example
| r | Z | D | 3 ^ D | Estimate (E) | Actual Value of √r |
| 723.47 | 723 | 3 | 27 | 13.5 | 26.89 |
| 5396.37 | 5396 | 4 | 81 | 40.5 | 73.45 |
| 24956.41 | 24956 | 5 | 243 | 121.5 | 157.96 |
| 789345.464 | 789345 | 6 | 729 | 364.5 | 888.45 |
More accurate rough estimation
Similar to the rough estimation procedure above. This version is slightly more accurate because it also uses the additional information provided by the first digit of the number r. The steps are almost the same as the one for previous rough estimate. This estimate can be taken one extra step further by applying the Bakhshali square root approximation.
Provided that r » 1
Steps
- Take the integer part of the number r. Z = int(r)
- Count the number of digits in Z. Let D be the number of digits.
- Calculate the value of 3.16D. Note: 3.16 ≈ √10
- The estimate is the value obtain in step 3 multiple by an adjustment factor based on the first (left most) digit of the number n. E = ADJ * 3.16D
- Applying the Bakhshali square root approximation to the estimate E.
- <math>c = r - E^2<math>
- <math>P = \frac{c}{2 E}<math>
- <math>A = E + P<math>
- <math>B = A - \frac{P^2}{2 A}<math>
Table of ADJ
| First Digit | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| ADJ | 0.32 | 0.45 | 0.55 | 0.63 | 0.71 | 0.78 | 0.84 | 0.90 | 0.95 |
Example
| r | Z | D | 3.16 ^ D | ADJ | Estimate (E) | Bakhshali (B) | Actual Value of √r |
| 723.47 | 723 | 3 | 31.55 | 0.84 | 26.50 | 26.89 | 26.89 |
| 5396.37 | 5396 | 4 | 99.71 | 0.71 | 70.79 | 73.46 | 73.45 |
| 24956.41 | 24956 | 5 | 315.09 | 0.45 | 141.79 | 157.98 | 157.96 |
| 789345.464 | 789345 | 6 | 995.7 | 0.84 | 836.37 | 888.45 | 888.45 |
Inverse square root approximation
There is an algorithmn for finding the inverse square root <math>\left( \frac{1}{\sqrt{r}}\right )<math> very quickly.
Because <math>\sqrt{r} = r \times \left ( \frac{1}{\sqrt{r}} \right )<math>, if we know the value of the inverse square root, we can easily get the value for the square root.
Steps for Inverse square root approximation
Step 1 Start the initial value <math>X_0<math> an approximate value of the inverse square root which is accurate to 2 significant digits.
- <math>X_0 = \left( \frac{1}{\sqrt{r}} \right )_\mbox{approx}<math>
Step 2 Calculate the next iteration with the following algorithmn.
- <math>X_{n+1} = X_n \, \left( \frac{15}{8} - Y \, \left ( \frac{5}{4} - \frac{3}{8} \, Y \right ) \right )<math> where <math>Y = r \, X_n^2 <math>
Step 3 Finally obtain the value of <math>\sqrt{r}<math> with
- <math>\sqrt{r} = r \, X_{\infty}<math>
Because <math>X_{\infty}<math> is the inverse square root of r.
Properties
- The greatest weakness of this algorithmn is that it is not stable. The initial value <math>X_0<math> must be near the actual value for the algorithmn to converge correctly. If the initial value isn't closer enough, the algorithmn will diverge away from the actual value.
- However when the algorithmn converges, it converges very very quickly. You can get an result with 20 digits of accuracy with just 6 iterations.
Square roots using Newton iteration
Basic Newton iteration finds a single root of a function <math>f(x)<math> given a sufficiently precise approximation to the root. The nature of which root will be given based on an approximation is dependent on the Newton fractal which we will not discuss here any further. The basic iteration is given by:
- <math>x_{n+1} = x_n - {f(x_n) \over f^\prime(x_n)}<math>.
There are two widely used functions <math>f(x)<math> and <math>g(x)<math> used to find the square root of a number denoted by "z".
First method
The first method finds the square root of "z"
- <math>f(x) = x^2 - z \,<math>
Note that both <math>\sqrt{z}<math> and <math>- \sqrt{z}<math> are roots of the function <math>f(x)<math>. ie <math>f( \sqrt{z} ) = 0<math>.
The first derivative of <math>f(x)<math> is <math>f^\prime(x) = 2 x<math>
Thus iteration for <math>x_{n+1}<math> is derived where:
<math>x_0 = 1 \,\,\,<math> and
| <math>x_{n+1}\,\!<math> | <math>= x_n - {f(x_n) \over f^\prime(x_n)}<math> |
| <math>= x_n - {(x_n^2 - z) \over 2 x_n}<math> | |
| <math>= x_n - \frac {x_n}{2} + \frac {z}{2 \,\,\, x_n} <math> | |
| <math>= \frac {x_n}{2} + \frac {z}{2 \,\,\, x_n}<math>. |
Second method
The second method finds the reciprocal of the square root of "z".
- <math>g(x) = \frac{1}{x^{2}} - z<math>.
The two roots to <math>g(x)<math> are <math>\frac{1}{\sqrt{z}}<math> and <math>\frac{-1}{\sqrt{z}}<math>.
The derivative of <math>g(x)<math> is <math>g^\prime(x) = -2 x^{-3}<math>.
Thus iteration for <math>x_{n+1}<math> is derived where:
<math>x_0 = 0.5<math> and
| <math>x_{n+1} \,\! <math> | <math>= x_n - {g(x_n) \over g^\prime(x_n)}<math> |
| <math>= x_n - {x_n^{-2} - z \over -2 x_n^{-3}}<math> | |
| <math>= x_n - (-1/2) {x_n^3} (x^{-2} - z)<math> | |
| <math>= x_n + (1/2) (x_n - z x_n^3)<math> | |
| <math>= \frac{ 3 x_n - z x_n^3 }{2}<math> | |
| <math>= 1.5 \, x_n - 0.5 \, z x_n^3 = 0.5 \, x_n \,\, ( 3 - z x_n^2 )<math>. |
Example
Find the <math>\sqrt{7}<math> using both methods.
- <math>z = 7 \,<math> Because we are looking for the square root of 7
| <math>f(x)\,<math> | <math>g(x)\,<math> | |||
|---|---|---|---|---|
| <math>x_0\,<math> | <math>1\,<math> | <math>x_0\,<math> | <math>0.5\,<math> | |
| <math>x_1\,<math> | <math>\frac{1}{2} + \frac{7}{2 \times 1} = 4 <math> | <math>x_1\,<math> | <math>0.5 \times 0.5 \,\, ( 3 - 7 (0.5)^2 ) = 0.312 <math> | <math>\frac{1}{x_1}= 3.2\,<math> |
| <math>x_2\,<math> | <math>\frac{4}{2} + \frac{7}{2 \times 4} = 2.875 <math> | <math>x_2\,<math> | <math>0.5 \times 0.312 \,\, ( 3 - 7 (0.312)^2 ) = 0.362 <math> | <math>\frac{1}{x_2}= 2.762\,<math> |
| <math>x_3\,<math> | <math>\frac{2.875}{2} + \frac{7}{2 \times 2.875} = 2.654 <math> | <math>x_3\,<math> | <math>0.5 \times 0.362 \,\, ( 3 - 7 (0.362)^2 ) = 0.376 <math> | <math>\frac{1}{x_3}= 2.652\,<math> |
| <math>x_4\,<math> | <math>\frac{2.654}{2} + \frac{7}{2 \times 2.654} = 2.645 <math> | <math>x_4\,<math> | <math>0.5 \times 0.376 \,\, ( 3 - 7 (0.376)^2 ) = 0.378 <math> | <math>\frac{1}{x_4}= 2.645\,<math> |
| <math>\sqrt{7} \approx 2.645<math> | <math>\sqrt{7} \approx 2.645<math> | |||
Comparison
The iteration for <math>f(x)<math> involves a division which is more time consuming than a multiplication in computer integer arithmetic. The iteration for <math>g(x)<math> involves no division and is thus recommended for large integers z.
This iteration using "g" involves only a squaring and two multiplications, as opposed to a division in the case of f. In practical implementations of large integer square roots, the iteration involving g is faster for large integers z since division is at best <math>O(M(n))<math>, a constant times the time function of multiplication. The constant term is almost always 3 or more, meaning that a single division can almost never be faster than 3 multiplications.
Pell's equation
Pell's equation yields a method for finding rational approximations of square roots of integers.
Finding square roots using mental arithmetic
Based on Pell's equation there is a method to calculate square roots simply by subtracting odd numbers.
Ex: For <math>\sqrt{27}<math> we start with the following sequence:
27 - 1 = 26 26 - 3 = 23 23 - 5 = 18 18 - 7 = 11 11 - 9 = 2
Five steps have been taken and thus the integer part of the square root of 27 is 5. We do not proceed any further because the sixth subtraction would give a negative answer.
Now take the rest (2) and multiply it by 100 to get the starting number for the next step. Take the answer we have already got (5) and multiply it by 20, then add 1 to get the first odd number we subtract by. This gives us 2 × 100 = 200 as the starting number and 5 × 20 + 1 = 101 as the first odd number. Subtract the successive odd numbers, 103, 105, etc. until we get to a step where the next subtraction would result in a negative number. So,
200 - 101 = 99
and 99 is less than 103 so this is the place to stop and since we only took one step we get that the next digit is 1.
For the next step the starting number will be 99 × 100 = 9900 and the answer we have already got is 51 so the first odd number will be 51 × 20 + 1 = 1021
9900 - 1021 = 8879 8879 - 1023 = 7856 7856 - 1025 = 6831 6831 - 1027 = 5804 5804 - 1029 = 4775 4775 - 1031 = 3744 3744 - 1033 = 2711 2711 - 1035 = 1676 1676 - 1037 = 639
We took nine steps so the next digit is 9.
Continuing with this procedure, the next starting number will be 639 × 100 = 63900 and the first odd number will be 519 × 20 + 1 = 10381
63900 - 10381 = 53519 53519 - 10383 = 43136 43136 - 10385 = 32751 32751 - 10387 = 22364 22364 - 10389 = 11975 11975 - 10391 = 1584
We took six steps so the next digit is 6.
The result gives us 5.196 as an approximation of the square root of 27.
Finding square roots using basic arithmetic
If you have access to a calculator capable of addition, subtraction, multiplication and division then the following method can be used to find the square root of a number.
Find <math>\sqrt{r}<math>
- <math>A_{base} = r \qquad \qquad \qquad \qquad at \quad the \quad very \quad start<math>
- <math>B_{base} = SOLN \times 20 + 1 \qquad where \quad SOLN=0 \quad at \quad the \quad very \quad start<math>
The starting values are
- <math>D_0 = 9<math>
- <math>A_0 = A_{base} + D_0 \, (D_0 - 1)<math>
- <math>B_0 = B_{base} + 2 \, (D_0 - 1) <math>
Now find new values for each variable
- <math>A_n = A_{base} + D_n \, ( D_n - 1 ) <math>
- <math>B_n = B_{base} + 2 \, ( D_n - 1 ) <math>
- <math>D_{n+1} = floor ( A_n \div B_n ) <math>
We found a digit when the value of “<math>D_n<math>” is equal to the value of “<math>floor ( A_n \div B_n )<math>”
After a new digit has been found.
- New <math>A_{base} = 100 \, ( A_n - B_n \times D_n ) <math>
- New <math>B_{base} = SOLN \times 20 + 1 <math>
The step are shown in the table below
| Find <math>\sqrt{27}<math> | ||||||
|---|---|---|---|---|---|---|
| <math>A_{base} = Z = 27 <math> and <math>B_{base} = 0 \times 20 + 1 = 1 <math> | ||||||
| <math>n<math> | <math>D_n<math> | <math>A_n<math> | <math>B_n<math> | <math>floor ( A_n \div B_n )<math> | Remarks | SOLN |
| n=0 | <math>9<math> | <math>27 + 9 \times 8 = 99<math> | <math>1 + 2 \times 8 = 17<math> | <math>5<math> | ||
| n=1 | <math>5<math> | <math>27 + 5 \times 4 = 47<math> | <math>1 + 2 \times 4 = 9<math> | <math>5<math> | STOP | <math>5<math> |
| <math>A_{base} = 100 \, (47 - 9 \times 5 ) = 200 <math> and <math>B_{base} = 5 \times 20 + 1 = 101 <math> | ||||||
| n=0 | <math>9<math> | <math>200 + 9 \times 8 = 272<math> | <math>101 + 2 \times 8 = 117<math> | <math>2<math> | ||
| n=1 | <math>2<math> | <math>200 + 2 \times 1 = 202<math> | <math>101 + 2 \times 1 = 103<math> | <math>1<math> | ||
| n=2 | <math>1<math> | <math>200 + 1 \times 0 = 200<math> | <math>101 + 2 \times 0 = 101<math> | <math>1<math> | STOP | <math>51<math> |
| <math>A_{base} = 100 \, (200 - 101 \times 1 ) = 9900 <math> and <math>B_{base} = 51 \times 20 + 1 = 1021 <math> | ||||||
| n=0 | <math>9<math> | <math>9900 + 9 \times 8 = 9972<math> | <math>1021 + 2 \times 8 = 1037<math> | <math>9<math> | STOP | <math>519<math> |
| <math>A_{base} = 100 \, (9972 - 1037 \times 9 ) = 63900 <math> and <math>B_{base} = 519 \times 20 + 1 = 10381 <math> | ||||||
| n=0 | <math>9<math> | <math>63900 + 9 \times 8 = 63972<math> | <math>10381 + 2 \times 8 = 10397<math> | <math>6<math> | ||
| n=1 | <math>6<math> | <math>63900 + 6 \times 5 = 63930<math> | <math>10381 + 2 \times 5 = 10391<math> | <math>6<math> | STOP | <math>5196<math> |
| <math>A_{base} = 100 \, (63930 - 10391 \times 6 ) = 158400 <math> and <math>B_{base} = 5196 \times 20 + 1 = 103921 <math> | ||||||
| n=0 | <math>9<math> | <math>158400 + 9 \times 8 = 158472<math> | <math>103921 + 2 \times 8 = 103937<math> | <math>1<math> | ||
| n=1 | <math>1<math> | <math>158400 + 1 \times 0 = 158400<math> | <math>103921 + 2 \times 0 = 103921<math> | <math>1<math> | STOP | <math>51961<math> |
| <math>\sqrt{27} \approx 5.1961 <math> | ||||||
Continued fraction methods
Quadratic irrationals, that is numbers involving square roots in the form (a + √b)/c, have periodic continued fractions. This makes them easy to calculate recursively given the period. For example, to calculate √2, we make use of the fact that √2 − 1 = [0; 2, 2, 2, 2, 2, ...], and use the recurrence relation
- an + 1 = 1/(2 + an) with a0 = 0
to obtain √2 − 1 to some specific precision specified through n levels of recurrence, and add 1 to the result to obtain √2.
Steps for finding continued fractions
Find <math>\sqrt{r}<math> using continued fractions
- <math>\sqrt{r} = N_0 + \frac{1}{N_1 + \frac{1}{N_2 + \frac{1}{N_3+\,\cdots}}} <math>
Let <math>\sqrt{r}=\sqrt{N_0^2 + d}= N_0 + \frac{1}{X_0} \qquad where \quad X_0 > 1 \qquad \mbox{ and } \quad N_0 \in \mathbb{Z^+} <math>
thus
- <math>\sqrt{r} = N_0 + \frac{1}{X_0}<math>
- <math>X_0 = N_1 + \frac{1}{X_1}<math>
- <math>X_1 = N_2 + \frac{1}{X_2}<math>
- <math>X_2 = N_3 + \frac{1}{X_3}<math>
Step 0. We shall assume that r is not a perfect square. In other words:
- <math>\sqrt{r} = \sqrt{N_0^2 + d} \qquad \mbox{ and } \quad N_0 \in \mathbb{Z^+} \quad \mbox{ and } 0 < d < 1 <math>
Step 1. Find <math>N_0<math> using some other method. The best method is <math>N_0 = intsqrt(r)<math> using some other algorithmn to determine the integer square root.
- <math>N_0 = intsqrt(r)<math>
Step 2. Find the highest lower bound (L) and lowest upper bound (U) for <math>\sqrt{r}<math> where both (L) and (U) are integers.
- <math>L \qquad < \qquad \sqrt{r} \qquad < \qquad U <math>
Hence
- <math>L \qquad = \qquad N_0 <math>
- <math>U \qquad = \qquad N_0 + 1<math>
Step 3. Write <math>X_0<math> in terms of <math>\sqrt{r}<math>.
- <math>X_0 = \frac{1}{\sqrt{r}-N_0} \qquad from \qquad \sqrt{r} = N_0 + \frac{1}{X_0}<math>
- <math>X_0 = \frac{1}{\sqrt{r}-N_0} \times \frac{\sqrt{r}+N_0}{\sqrt{r}+N_0} = \frac{\sqrt{r}+N_0}{r-N_0^2} = \frac{\sqrt{r}+N_0}{d} = \frac{\sqrt{r}+M_0}{D_0} <math>
- <math>\mbox { where } \quad M_0 = N_0 <math>
and
- <math>\mbox { where } \quad D_0 = d <math>
- <math>X_0 = \frac {\sqrt{r} + M_0 } {D_0}<math>
- <math>\downarrow<math>
- <math>\mbox{ substitute } \quad \sqrt{r} \quad \mbox{ with } \quad L \quad \mbox{ or } \quad U<math>
- <math>\downarrow<math>
- <math>X_{0 LowerBound} = \frac{\sqrt{r}+M_0}{D_0} = \frac{L+M_0}{D_0} = \frac{ N_0 + M_0 }{D_0} \qquad \mbox{ Calc the numeric value }<math>
and
- <math>X_{0 UpperBound} = \frac{\sqrt{r}+M_0}{D_0} = \frac{U+M_0}{D_0} = \frac{ (N_0 + 1) + M_0 }{D_0} \qquad \mbox{ Calc the numeric value }<math>
Step 4. Substitute <math>X_0<math> with <math>N_1 + \frac{1}{X_1}<math>
- <math>X_{0 LowerBound} \quad < \quad X_0 \quad < \quad X_{0 UpperBound} <math>
after substitution
- <math>X_{0 LowerBound} \quad < \quad N_1 + \frac{1}{X_1} \quad < \quad X_{0 UpperBound} <math>
Since <math>\frac{1}{X_1}<math> is less than one, we can determine <math>N_1<math> from the numeric values of <math>X_{0 LowerBound}<math> and <math>X_{0 UpperBound}<math> because <math>N_1 \ \in \ \mathbb{Z^+}<math> (ie. <math>N_1<math> is an integer). Determine the numeric value of <math>N_1<math>.
Step 5. Once we know the value of <math>N_1<math>, we can rework the equation for <math>X_1<math>
- <math>X_0 = N_1 + \frac{1}{X_1} \quad \longrightarrow \quad X_1 = \frac{1}{X_0 - N_1}<math>
- <math>X_1 = \frac{1}{ \frac { \sqrt{r} + M_0 } { D_0 } - N_1 } = \frac{1}{ \frac { \sqrt{r} + M_0 - D_0 \, N_1 } { D_0 } } = \frac { D_0 } { \sqrt{r} + M_0 - D_0 \, N_1 } <math>
- <math>X_1 = \frac { D_0 } { \sqrt{r} + ( M_0 - D_0 \, N_1 ) } \times \frac { \sqrt{r} - ( M_0 - D_0 \, N_1 ) } { \sqrt{r} - ( M_0 - D_0 \, N_1 ) } = \frac { D_0 ( \sqrt{r} - ( M_0 - D_0 \, N_1 ) ) } { r - ( M_0 - D_0 \, N_1 )^2 }<math>
- <math>X_1 = \frac { \sqrt{r} - ( M_0 - D_0 \, N_1 ) } { \frac { r - ( M_0 - D_0 \, N_1 )^2 } { D_0 } } = \frac { \sqrt{r} + M_1 } { D_1 } <math>
- <math>\mbox { where } \quad M_1 = - ( M_0 - D_0 \, N_1 ) <math>
and
- <math>\mbox { where } \quad D_1 = \frac { r - ( M_0 - D_0 \, N_1 )^2 } { D_0 } <math>
Step 6. Write <math>X_1<math> in terms of <math>\sqrt{r}<math>.
- <math>X_1 = \frac {\sqrt{r} + M_1 } {D_1}<math>
- <math>\downarrow<math>
- <math>\mbox{ substitute } \quad \sqrt{r} \quad \mbox{ with } \quad L \quad \mbox{ or } \quad U<math>
- <math>\downarrow<math>
- <math>X_{1 LowerBound} = \frac{\sqrt{r}+M_1}{D_1} = \frac{L + M_1}{D_1} = \frac{ N_0 + M_1 }{D_1} \qquad \mbox{ Calc the numeric value }<math>
and
- <math>X_{1 UpperBound} = \frac{\sqrt{r}+M_1}{D_1} = \frac{U + M_1}{D_1} = \frac{ (N_0 + 1) + M_1 }{D_1} \qquad \mbox{ Calc the numeric value }<math>
Step 7. Substitute <math>X_1<math> with <math>N_2 + \frac{1}{X_2}<math>
- <math>X_{1 LowerBound} \quad < \quad X_1 \quad < \quad X_{1 UpperBound} <math>
after substitution
- <math>X_{1 LowerBound} \quad < \quad N_2 + \frac{1}{X_2} \quad < \quad X_{1 UpperBound} <math>
Since <math>\frac{1}{X_2}<math> is less than one, we can determine <math>N_2<math> from the numeric values of <math>X_{1 LowerBound}<math> and <math>X_{1 UpperBound}<math> because <math>N_2 \ \in \ \mathbb{Z^+}<math> (ie. <math>N_2<math> is an integer). Determine the numeric value of <math>N_2<math>.
Step 8. Once we know the value of <math>N_2<math>, we can rework the equation for <math>X_2<math>
- <math>X_1 = N_2 + \frac{1}{X_2} \quad \longrightarrow \quad X_2 = \frac{1}{X_1 - N_2}<math>
- <math>X_2 = \frac{1}{ \frac { \sqrt{r} + M_1 } { D_1 } - N_2 } = \frac{1}{ \frac { \sqrt{r} + M_1 - D_1 \, N_2 } { D_1 } } = \frac { D_1 } { \sqrt{r} + M_1 - D_1 \, N_2 } <math>
- <math>X_2 = \frac { D_1 } { \sqrt{r} + ( M_1 - D_1 \, N_2 ) } \times \frac { \sqrt{r} - ( M_1 - D_1 \, N_2 ) } { \sqrt{r} - ( M_1 - D_1 \, N_2 ) } = \frac { D_1 ( \sqrt{r} - ( M_1 - D_1 \, N_2 ) ) } { r - ( M_1 - D_1 \, N_2 )^2 }<math>
- <math>X_2 = \frac { \sqrt{r} - ( M_1 - D_1 \, N_2 ) } { \frac { r - ( M_1 - D_1 \, N_2 )^2 } { D_1 } } = \frac { \sqrt{r} + M_2 } { D_2 } <math>
- <math>\mbox { where } \quad M_2 = - ( M_1 - D_1 \, N_2 ) <math>
and
- <math>\mbox { where } \quad D_2 = \frac { r - ( M_1 - D_1 \, N_2 )^2 } { D_1 } <math>
Step 9. Repeat step 6 , 7 and 8 .
Quadratic equation method
The solution to a properly setup quadratic equation can be used to find <math>\sqrt{r}<math> where 1 < r < 100
For square root of values greater than 100, use the following identity:
For square root of values less than 1, use the following indentity:
|
Using the equation <math>\sqrt{r} \,=\, N + \frac{1}{X}<math> where <math>X > 1<math> and <math>N \in \{1,2,3,4,5,6,7,8,9\}<math>
- <math>\sqrt{r} \,=\, N + \frac{1}{X}<math>
- <math>r \,=\, { \left( N + \frac{1}{X} \right ) }^2<math>
- <math>r \,=\, N^2 + \frac{2\,N}{X} + \frac{1}{X^2}<math>
- <math>0 \,=\, \left( N^2 - r \right) + \frac{2\,N}{X} + \frac{1}{X^2}<math>
- <math>\left( N^2 - r \right) + \frac{2\,N}{X} + \frac{1}{X^2} \,=\, 0<math>
- <math>\left( N^2 - r \right) \, X^2 + \left( 2\,N \right) X + 1 \,=\, 0<math>
Solve for <math>X<math> using quadratic equation formula, choose the solution that satisfy the restriction <math> X > 1 <math>.
Final solution is :
- <math>\sqrt{r} \,=\, N + \frac{1}{X}<math>
The obvious problem is that we cannot evaluate the solutions to the quadratic equation without the usage of the square root function. However we can make the snake bite its own tail.
- <math>\left( N^2 - r \right) \, X^2 + \left( 2\,N \right) X + 1 \,=\, 0<math>
- Let <math>r \, = \, N^2 + d <math>
- Thus <math> d \, = \, r - N^2 <math>
- And <math> - d \, = \, N^2 - r <math>
So the quadratic equation becomes :
- <math>\left( - d \right) \, X^2 + \left( 2\,N \right) X + 1 \,=\, 0<math>
Solving for X as far as possible brings
- <math> X \, = \, \frac{N + \sqrt{N^2 + d}}{d}<math>
Reciprocal
- <math> \frac{1}{X} \, = \, \frac{d}{N + \sqrt{N^2 + d}}<math>
So the final solution becomes
- <math>\sqrt{r} \,=\, N + \frac{1}{X}<math>
- <math>\sqrt{r} \,=\, N + \frac{d}{N + \sqrt{N^2 + d}} <math>
- <math>\sqrt{r} \,=\, N + \frac{d}{N + \sqrt{r}} <math>
Lets go deeper by substituting √r on the right hand side with its own definition.
- <math>\sqrt{r} \,=\, N + \frac{d}{N + \left( N + \frac{d}{N + \sqrt{r}} \right) } <math>
Renormalise
- <math>\sqrt{r} \,=\, N + \frac{d}{2 N + \frac{d}{N + \sqrt{r}} } <math>
Deeper still
- <math>\sqrt{r} \,=\, N + \frac{d}{2 N + \frac{d}{2 N + \frac{d}{N + \sqrt{r}} } } <math>
And so on and so forth
- <math>\sqrt{r} \,=\, N + \frac{d}{2 N + \frac{d}{2 N + \frac{d}{2 N + \frac{d}{N + \sqrt{r}} } } } <math>
Example using the quadratic equation method
Find <math>\sqrt{923.45}<math>
- Using identity <math>\sqrt{923.45} \,=\, \sqrt{9.2345} \times 10 <math>
- First find <math>\sqrt{9.2345}<math>.
- <math>\sqrt{r} \,=\, N + \frac{1}{X}<math>
- <math>\sqrt{9.2345} \,=\, N + \frac{1}{X}<math>
Hence <math> N \,=\, 3 \,\! <math> because <math> \!\; 3^2 \; < \; 9.2345 \; < \; 4^2 <math>
- <math>\left( N^2 - r \right) \, X^2 + \left( 2\,N \right) X + 1 \,=\, 0<math>
- <math>\left( 3^2 - 9.2345 \right) \, X^2 + \left( 2 \, \cdot \, 3 \right) X + 1 \,=\, 0<math>
- <math>-0.2345 \, X^2 + 6 \, X + 1 \,=\, 0<math>
Using the quadratic equation formula,
we get the two solutions. soln1 = - 0.165 or soln2 = 25.7519
Choose soln2 as it satisfy the restriction <math> X > 1 <math>.
- Hence <math>X = 25.7519<math>
- <math>\sqrt{9.2345} \,=\, 3 + \frac{1}{25.7519} \,=\, 3.03883<math>
Alternatively
- <math>\sqrt{r} \,=\, N + \frac{d}{2 N + \frac{d}{2 N + \frac{d}{N + \sqrt{r}} } } <math>
- <math>\sqrt{9.2345} \,=\, 3 + \frac{0.2345}{6 + \frac{0.2345}{6 + \frac{0.2345}{3 + \sqrt{9.2345}} } } <math>
- <math>\sqrt{9.2345} \,\approx\, 3 + \frac{0.2345}{6 + \frac{0.2345}{6 + \frac{0.2345}{3 + 3} } } <math>
- <math>\sqrt{9.2345} \,\approx\, 3.03883 <math>
And the final solution is
- <math>\sqrt{923.45} \,=\, \sqrt{9.2345} \times 10 \,=\, 30.3883<math>
Square roots of complex numbers
To every non-zero complex number z there exist precisely two numbers w such that w2 = z. The usual definition of √z is as follows: if z = r exp(iφ) is represented in polar coordinates with -π < φ ≤ π, then we set √z = √r exp(iφ/2). Thus defined, the square root function is holomorphic everywhere except on the non-positive real numbers (where it isn't even continuous). The above Taylor series for √(1+x) remains valid for complex numbers x with |x| < 1.
When the number is in rectangular form the following formula can be used:
- <math>\sqrt{x+iy} = \sqrt{\frac{\left|x+iy\right| + x}{2}} \pm i \sqrt{\frac{\left|x+iy\right| - x}{2}}<math>
where the sign of the imaginary part of the root is the same as the sign of the imaginary part of the original number.
Note that because of the discontinuous nature of the square root function in the complex plane, the law √(zw) = √(z)√(w) is in general not true. Wrongly assuming this law underlies several faulty "proofs", for instance the following one showing that -1 = 1:
- <math>-1 = i \times i = \sqrt{-1} \times \sqrt{-1} = \sqrt{-1 \times -1} = \sqrt{1} = 1<math>
The third equality cannot be justified. (See invalid proof.)
However the law can only be wrong up to a factor -1, √(zw) = ±√(z)√(w), is true for either ± as + or as - (but not both at the same time). Note that √(c2) = ±c, therefore √(a2b2) = ±ab and therefore √(zw) = ±√(z)√(w), using a = √(z) and b = √(w).
Square roots of matrices and operators
If A is a positive definite matrix or operator, then there exists precisely one positive definite matrix or operator B with B2 = A; we then define √A = B.
More generally, to every normal matrix or operator A there exist normal operators B such that B2 = A. In general, there are several such operators B for every A and the square root function cannot be defined for normal operators in a satisfactory manner. Positive definite operators are akin to positive real numbers, and normal operators are akin to complex numbers.
Infinitely nested square roots
Under certain condition infinitely nested radicals such as
- <math> x = \sqrt{2+\sqrt{2+\sqrt{2+\sqrt{2+\cdots}}}} <math>
represent rational numbers. This rational number can be found by realizing that x also appears under the radical sign, which gives the equation
- <math> x = \sqrt{2+x}. <math>
If we solve this equation, we find that x = 2. More generally, we find that
- <math> \sqrt{n+\sqrt{n+\sqrt{n+\sqrt{n+\cdots}}}} = \frac{1 + \sqrt {1+4n}}{2}. <math>
The same procedure also works to get
- <math> \sqrt{n-\sqrt{n-\sqrt{n-\sqrt{n-\cdots}}}} = \frac{-1 + \sqrt {1+4n}}{2}. <math>
This method will give a rational <math> x <math> value for all values of <math> n <math> such that
- <math> {n} = {x^2} + {x}. <math>
Square roots of the first 20 positive integers
√ 1 = 1
√ 2 ≈ 1.4142135623 7309504880 1688724209 6980785696 7187537694 8073176679 7379907324 78462
√ 3 ≈ 1.7320508075 6887729352 7446341505 8723669428 0525381038 0628055806 9794519330 16909
√ 4 = 2
√ 5 ≈ 2.2360679774 9978969640 9173668731 2762354406 1835961152 5724270897 2454105209 25638
√ 6 ≈ 2.4494897427 8317809819 7284074705 8913919659 4748065667 0128432692 5672509603 77457
√ 7 ≈ 2.6457513110 6459059050 1615753639 2604257102 5918308245 0180368334 4592010688 23230
√ 8 ≈ 2.8284271247 4619009760 3377448419 3961571393 4375075389 6146353359 4759814649 56924
√ 9 = 3
√10 ≈ 3.1622776601 6837933199 8893544432 7185337195 5513932521 6826857504 8527925944 38639
√11 ≈ 3.3166247903 5539984911 4932736670 6866839270 8854558935 3597058682 1461164846 42609
√12 ≈ 3.4641016151 3775458705 4892683011 7447338856 1050762076 1256111613 9589038660 33818
√13 ≈ 3.6055512754 6398929311 9221267470 4959462512 9657384524 6212710453 0562271669 48293
√14 ≈ 3.7416573867 7394138558 3748732316 5493017560 1980777872 6946303745 4673200351 56307
√15 ≈ 3.8729833462 0741688517 9265399782 3996108329 2170529159 0826587573 7661134830 91937
√16 = 4
√17 ≈ 4.1231056256 1766054982 1409855974 0770251471 9922537362 0434398633 5730949543 46338
√18 ≈ 4.2426406871 1928514640 5066172629 0942357090 1562613084 4219530039 2139721974 35386
√19 ≈ 4.3588989435 4067355223 6981983859 6156591370 0392523244 4936890344 1381595573 28203
√20 ≈ 4.4721359549 9957939281 8347337462 5524708812 3671922305 1448541794 4908210418 51276
da:Kvadratrod de:Quadratwurzel es:Raíz cuadrada fr:Racine carrée is:Ferningsrót it:Radice quadrata nl:Vierkantswortel ja:平方根 pl:Pierwiastek kwadratowy pt:Raiz quadrada su:Akar kuadrat fi:Neliöjuuri sv:Kvadratrot zh:平方根
See also
External links
- Japanese soroban techniques (http://webhome.idirect.com/~totton/soroban/katoSq/) - Professor Fukutaro Kato's method
- Japanese soroban techniques (http://www.gis.net/~daveber/Abacus/SquareRoot.html) - Takashi Kojima's method