Square root of 3 billion digits. The fraction (…) for the square root of three can be used as an approximation. Despite having a denominator of only 56, it differs from the correct value by less than (approximately ). The rounded value of 1.732 is correct to within 0.01% of the actual value. Archimedes reported , accurate to (six decimal places) and (four decimal places), respectively. It can be expressed as the continued fraction , expanded on the right. It can also be expressed by generalized continued fractions such as which is evaluated at every second term. The following nested square expressions converge to
Square root than for small "n". If "a" is positive, the convergence is quadratic, which means that in approaching the limit, the number of correct digits roughly doubles in each next iteration. If , the convergence is only linear. Using the identity the computation of the square root of a positive number can be reduced to that of a number in the range . This simplifies finding a start value for the iterative method that is close to the square root, for which a polynomial or piecewise-linear approximation can be used. The time complexity for computing a square root with "n" digits