11 (number) to be a Mersenne prime, the converse is not true: 2 − 1 = 2047 which is 23 × 89. 11 raised to the nth power is the nth row of Pascal's Triangle. (This works for any base, but the number eleven must be changed to the number represented as 11 in that base; for example, in duodecimal this must be done using thirteen.) 11 is a Heegner number, meaning that the ring of integers of the field formula_1 has the property of unique factorization. One consequence of this is that there exists at most one point on the elliptic
Prime number this decreases exponentially with the number of tests, it provides high confidence (although not certainty) that a number that passes the repeated test is prime. On the other hand, if the test ever fails, then the number is certainly composite. A composite number that passes such a test is called a pseudoprime. In contrast, some other algorithms guarantee that their answer will always be correct: primes will always be determined to be prime and composites will always be determined to be composite. For instance, this is true of trial division. The algorithms with guaranteed-correct output include both deterministic (non-random) algorithms,