Square rootIn mathematics, the square root of a non-negative real number x is denoted For example, This example suggests how square roots can arise when solving quadratic equations such as x2 = 9 or, more generally, ax2 + bx + c = 0. Extending the square root concept to negative real numbers gives rise to imaginary and complex numbers. Square roots of integers are often irrational numbers, i.e., numbers not expressible as one integer over another. (It is a misconception that mathematicians define irrational number to be one whose decimal expansion is infinite and non-repeating. That is equivalent, but nothing is sacred about base-10 numerals as opposed to other bases.) For example, The discovery that 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").
PropertiesThe following important properties of the square root functions are valid for all positive real numbers x and y:
The square root function generally maps rational numbers to algebraic numbers; In geometrical terms, the square root function maps the area of a square to its side length. Suppose that x and a are reals, and that x2 = a, and we want to find x. A common mistake is to "take the square root" and deduce that 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: It is valid for all non-negative numbers x and y which are not both zero. The function The function is continuous for all non-negative x, and differentiable for all positive x (it is not differentiable for x = 0 since the slope of the tangent there is ∞). Its derivative is given by Its Taylor series about x = 1 can be found using the binomial theorem: for Computing square rootsCalculatorsPocket calculators typically implement good routines to compute the exponential function and the natural logarithm, and then compute the square root of x using the identity The same identity is exploited when computing square roots with logarithm tables or slide rules. Babylonian methodA commonly used algorithm for approximating
This is a quadratically convergent algorithm, which means that the number of correct digits of r roughly doubles with each step. This could be represented as f(x + 1) = 0.5(r + ( 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 + 3 in the reals, but to - 3 in the 2-adics. An exact "long-division like" algorithmThis 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:
____1__2._3__4_
| 01 52.27 56 1
x 01 1*1=1 1
____ __
00 52 22
2x 00 44 22*2=44 2
_______ ___
08 27 243
24x 07 29 243*3=729 3
_______ ____
98 56 2464
246x 98 56 2464*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. Square roots using Newton iterationBasic Newton iteration finds a single root of a function f(x) given a sufficently 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:
There are two widely used functions f(x) used to find the square root of a number, say, "z". One finds the square root of "z" while the other finds the reciprocal of the square root of "z". The former gives sufficiently precise approximations to the square root of "z" with each iteration. The latter requires that one divide We have the two functions given as follows:
and
Note that for "f", we have f(z1 / 2) = 0. For "g", we have g(1 / z1 / 2) = 0. If one multiplied the roots of "g" by "z", the result will be We first find the derivative of these two functions. We have:
The iteration for "f" is derived here:
The iteration for "f" involves a division which is more time consuming than a multiplication in computer integer arithmetic. The iteration for "g" involves no division and is therefore recommended for large integers "z". We present the iteration for "g" as follows:
This iteration using "g" involves only a squaring and a two multiplications, as apposed 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 O(M(n)), 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 equationPell's equation yields a method for finding rational approximations of square roots of integers. Finding square roots using mental arithmeticBased on Pell's equation there is a method to calculate square roots simply by subtracting odd numbers. Ex:
2 x 100 = 200 and 5 x 20 + 1 = 101 1) 200-101 = 99 Next number is 1 99 x 100 = 9900 and 51 x 20 + 1 = 1021 1) 9900-1021 = 8879 2) 8879-1023 = 7856 3) 7856-1025 = 6831 4) 6831-1027 = 5804 5) 5804-1029 = 4775 6) 4775-1031 = 3744 7) 3744-1033 = 2711 8) 2711-1035 = 1676 9) 1676-1037 = 639 Next number is 9 The result gives us 5.19 as an approximation of the square root of 27 Continued fraction methodsQuadratic 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
to obtain √2 − 1 to some specific precision specified through n levels of recurrence, and add 1 to the result to obtain √2. Square roots of complex numbersTo 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: 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: 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 operatorsIf 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. Square roots of the first 20 positive integers√ 1 = 1 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
Categories: Algebra |
|
This article is licensed under the GNU Free Documentation License. It uses material from Wikipedia article. Browse Wikipedia for more information. |