Shifting nth root algorithm not useful for computing roots with a computer, as it is always outperformed by much simpler binary search, and has the same memory complexity. 1. 0 1 1 0 1 1. 7 3 2 0 5 1. 7 0 9 9 7 1. 6 2 6 5 7 Shifting nth root algorithm The shifting "n"th root algorithm is an algorithm for extracting the "n"th root of a positive real number which proceeds iteratively by shifting in "n" digits of the radicand, starting with the most significant, and produces one digit of the root on each iteration, in a manner similar
Square root of 2 The number can also be expressed by taking the Taylor series of a trigonometric function. For example, the series for gives The Taylor series of with and using the double factorial gives The convergence of this series can be accelerated with an Euler transform, producing It is not known whether can be represented with a BBP-type formula. BBP-type formulas are known for and , however. The number can be represented by an infinite series of Egyptian fractions, with denominators defined by 2th terms of a Fibonacci-like recurrence relation a(n)=34a(n-1)-a(n-2), a(0)=0, a(1)=6. The square root of two has the following continued