11 (number) is divisible by eleven. This also works by adding a trailing zero instead of a leading one: 65 + 63 + 70 = 198, which is divisible by 11. This also works with larger groups of digits, providing that each group has an even number of digits (not all groups have to have the same number of digits). An easy way of multiplying numbers by 11 in base 10 is: If the number has: In base 13 and higher bases (such as hexadecimal), 11 is represented as B, where ten is A. In duodecimal, however, 11 is sometimes represented as
Prime number instance the Solovay–Strassen primality test on a given number formula_20 chooses a number formula_34 randomly from formula_42 to formula_210 and uses modular exponentiation to check whether formula_211 is divisible by formula_20. If so, it answers yes and otherwise it answers no. If formula_20 really is prime, it will always answer yes, but if formula_20 is composite then it answers yes with probability at most 1/2 and no with probability at least 1/2. If this test is repeated formula_1 times on the same number, the probability that a composite number could pass the test every time is at most formula_216. Because