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
Root of unity modulo n it is not a primitive root, then there would be some divisor ℓ of "k", with formula_57. In order to exclude this possibility, one has only to check for a few ℓ's equal "k" divided by a prime. That is, what needs to be checked is: Among the primitive "k"-th roots of unity, the primitive formula_23-th roots are most frequent. It is thus recommended to try some integers for being a primitive formula_23-th root, what will succeed quickly. For a primitive formula_23-th root "x", the number formula_30 is a primitive formula_25-th root of unity. If "k" does not divide formula_23,