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 if is a monic polynomial with integer coefficients, then any rational root of is necessarily an integer. Applying this to the polynomial , it follows that is either an integer or irrational. Because is not an integer (2 is not a perfect square), must therefore be irrational. This proof can be generalized to show that any root of any natural number which is not the square of a natural number is irrational. See quadratic irrational or infinite descent for a proof that the square root of any non-square natural number is irrational. One proof of the number's irrationality is the