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 first known proof for this statement is attributed to him. Many more proofs of the infinitude of primes are known, including an analytical proof by Euler, Goldbach's proof based on Fermat numbers, Furstenberg's proof using general topology, and Kummer's elegant proof. Euclid's proof shows that every finite list of primes is incomplete. The key idea is to multiply together the primes in any given list and add formula_42. If the list consists of the primes formula_43, this gives the number By the fundamental theorem, formula_45 has a prime factorization with one or more prime factors. formula_45 is evenly divisible by