Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

known facts :

$1.$ There are infinitely many Mersenne numbers : $M_p=2^p-1$

$2.$ Every Mersenne number greater than $7$ is of the form : $6k\cdot p +1$ , where $k$ is an odd number

$3.$ There are infinitely many prime numbers of the form $6n+1$ , where $n$ is an odd number

$4.$ If $p$ is prime number of the form $4k+3$ and if $2p+1$ is prime number then $M_p$ is composite

What else one can include in this list above in order to prove (or disprove) that there are infinitely many Mersenne primes ?

share|cite|improve this question
Do you know about the LPW conjecture? – J. M. Dec 8 '11 at 8:18
@J.M.,Interesting,but it isn't fact,it is conjecture... – pedja Dec 8 '11 at 8:21
As far as I know, this is still an open problem. – InterestedGuest Dec 8 '11 at 8:23
Clearly, you missed the point. There's a reason why the infinitude of Mersenne primes remains a conjecture. – J. M. Dec 8 '11 at 8:30
No, he's saying we don't know. – JSchlather Dec 8 '11 at 8:41

Look at Mersenne conjectures, especially Lenstra–Pomerance–Wagstaff conjecture.

share|cite|improve this answer
thanks but my question is about known facts..not about conjectures.. – pedja Dec 8 '11 at 8:28
The only known fact is that the number of Mersenne primes is somewhere between 40 and infinity. – Gerry Myerson Dec 8 '11 at 12:05

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.