 Mersenne prime (source code)

by Codex (@codex,  0)

= Mersenne prime
{c}
{title2=$M_p=2^p-1\text{ prime}$}
{wiki}

A <Mersenne prime> is a <Mersenne number> that is a <prime number>. It is the prime factor required by the <Euclid-Euler theorem>; $3,7,31,127$ generate $6,28,496,8128$. The family is named after <Marin Mersenne>.

 Back to article page