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 a quadratic polynomial that (for integer arguments) is prime infinitely often. Euler's proof that there are infinitely many primes considers the sums of reciprocals of primes, Euler showed that, for any arbitrary real number formula_22, there exists a prime formula_20 for which this sum is bigger than formula_22. This shows that there are infinitely many primes, because if there were finitely many primes the sum would reach its maximum value at the biggest prime rather than growing past every formula_22. The growth rate of this sum is described more precisely by Mertens' second theorem. For comparison, the sum does not