| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Mersenne composite"
(restored) |
(No difference)
|
Latest revision as of 13:07, 19 February 2019
|
This article is only a stub. You can help PrimeWiki by expanding it. |
A Mersenne composite is any number of the form 2n-1 which is a composite number.
When n = pq where both p and q are integers greater than 1, then 2n-1 is always a Mersenne composite, because it is multiple of both Mersenne numbers 2p-1 and 2q-1.
