# Mersenne prime

♦
5 matching pages ♦

(0.001 seconds)

## 5 matching pages

##### 1: 27.18 Methods of Computation: Primes

…
►For small values of $n$, primality is proven by showing that $n$ is not divisible by any prime not exceeding $\sqrt{n}$.
…

##### 2: 27.12 Asymptotic Formulas: Primes

…
►where $\lambda (\alpha )$ depends only on $\alpha $, and $\varphi \left(m\right)$ is the Euler totient function (§27.2).
►A

*Mersenne prime*is a prime of the form ${2}^{p}-1$. The largest known prime (2018) is the Mersenne prime ${2}^{82,589,933}-1$. For current records see The Great Internet Mersenne Prime Search. …##### 3: 27.22 Software

##### 4: Bibliography G

…
►
…

##### 5: Errata

…
►
Paragraph Prime Number Theorem (in §27.12)
…

The largest known prime, which is a Mersenne prime, was updated from ${2}^{43,112,609}-1$ (2009) to ${2}^{82,589,933}-1$ (2018).