![]() |
![]() |
#1 |
Jun 2003
64616 Posts |
![]()
MMn= 2^(Mn)-1
Based on http://www.primepuzzles.net/conjectures/conj_015.htm if MMn is prime then 2^(Mn)+1/3 will also be. So can we try factoring 2^(Mn)+1/3? Has any work been done on this? Citrix Last fiddled with by Citrix on 2005-10-02 at 06:20 |
![]() |
![]() |
![]() |
#2 | |
Dec 2003
Hopefully Near M48
2×3×293 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#3 |
Mar 2003
New Zealand
13×89 Posts |
![]()
My logic might be letting me down here, but since p=M(n) automatically satisfies the first condition of the NMC when M(n) is a Mersenne prime, finding a factor of (2^M(n)+1)/3, as Citrix suggests, would prove that either the double Mersenne MM(n) is composite or the NMC is false. If we didn't already know that MM(n) was composite wouldn't that be progress?
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Double checking, quail factoring, trick question | Mark Rose | GPU to 72 | 11 | 2014-08-21 20:25 |
GPU attack on double Mersennes? | Uncwilly | GPU Computing | 29 | 2013-09-08 20:53 |
Double check of factoring?? | petrw1 | PrimeNet | 20 | 2010-01-29 17:25 |
Stars and Mersennes | David John Hill Jr | Science & Technology | 2 | 2009-12-13 09:47 |
LLT, double-checking and factoring at the same time | T.Rex | Math | 12 | 2006-02-08 20:35 |