Digital root number is the number mod 11 (Ɛ), for example, 1972 is 1 + 9 + 7 + 2 = 19 = 17 which is 1 + 7 = 8, while in decimal the root of the same number (3110) is 5; and in base 16 a digital root of a number is the number mod 15 (0xF), for example, 0x7DF is 7 + 13 + 15 = 35 = 0x23 which is 2 + 3 = 5, while in decimal the root of the same number (2015) is 8. Digital roots form an important mechanic in the visual novel adventure
Nth root algorithm Nth root algorithm The principal "n"th root formula_1 of a positive real number "A", is the positive real solution of the equation (for integer "n" there are "n" distinct complex solutions to this equation if formula_3, but only one is positive and real). There is a very fast-converging "n"th root algorithm for finding formula_1: A special case is the familiar square-root algorithm. By setting "n" = 2, the "iteration rule" in step 2 becomes the square root iteration rule: Several different derivations of this algorithm are possible. One derivation shows it is a special case of Newton's method (also called