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
Palindromic number types of palindromic numbers these values are listed below in a table. Here 0 is included. There are many palindromic perfect powers "n", where "n" is a natural number and "k" is 2, 3 or 4. The first nine terms of the sequence 1, 11, 111, 1111, ... form the palindromes 1, 121, 12321, 1234321, ... The only known non-palindromic number whose cube is a palindrome is 2201, and it is a conjecture the fourth root of all the palindrome fourth powers are a palindrome with 100000...000001 (10 + 1). G. J. Simmons conjectured there are no palindromes of form