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
Multiplicative digital root Multiplicative digital root The multiplicative digital root of a positive integer "n" is found by multiplying the digits of "n" together, then repeating this operation until only a single digit remains. This single-digit number is called the multiplicative digital root of "n". Multiplicative digital roots depend upon the base in which "n" is written. If the term is used without qualification, it is assumed that "n" is written in base 10. Multiplicative digital roots are the multiplicative equivalent of digital roots. 9876 would be reduced as 9876 -> 9×8×7×6 = 3024 -> 3×0×2×4 = 0. So the multiplicative digital root