My Math Forum New Mersenne numbers conjecture

 Number Theory Number Theory Math Forum

 February 29th, 2008, 05:27 PM #1 Newbie   Joined: Feb 2008 From: Brussels Posts: 3 Thanks: 0 New Mersenne numbers conjecture Is anyone able to find the demonstration of the following Mersenne conjecture? for j=3, d=2*p*j+1=6*p+1 divide M(p)=2^p-1 if and only if d is prime and mod( d,8 )=7 and p prime and there exists integer n and i such that: d=4*n^2 + 3*(3+6*i)^2 This conjecture has been numericaly tested for p up to 10^11 and is a particular case of one of three new Mersenne and Cunningham conjectures that I have introduced in the Math Mersenne numbers forum four weeks ago (http://mersenneforum.org/showthread.php?t=9945) But unfortunately up to now, no one of the three conjectures has been demonstrated. On this forum you will also find one numerical example (pdf file) for each of the three conjectures (see thread #20, #25 and #38 ) Regards, Olivier Latinne
March 1st, 2008, 11:10 AM   #2
Global Moderator

Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Re: New Mersenne numbers conjecture

I don't understand what you mean by "demonstration".

Quote:
 Originally Posted by o.latinne for j=3, d=2*p*j+1=6*p+1 divide M(p)=2^p-1 if and only if d is prime and mod( d,8 )=7 and p prime and there exists integer n and i such that: d=4*n^2 + 3*(3+6*i)^2
p = 21, d = 127: 127 | M(21), but 21 is not prime. There are many similar examples.

But if I change the conjecture to

Given a prime p and d = 6p + 1, then d | M(p) if and only if
• d ≡ 7 (mod 8)[/*:m:2ywqvqyb]
• d is prime[/*:m:2ywqvqyb]
• There exist nonnegative integers n and i with d = 4n^2 + 3(3 + 6i)^2[/*:m:2ywqvqyb]
then the conjecture seems to hold for p up to 10 million. (I verified this in 70 seconds with Pari/GP.)

 March 2nd, 2008, 08:10 AM #3 Global Moderator     Joined: Nov 2006 From: UTC -5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms I see that Dr. Sun solved it on the NMBRTHRY list.
March 2nd, 2008, 01:27 PM   #4
Newbie

Joined: Feb 2008
From: Brussels

Posts: 3
Thanks: 0

Quote:
 Originally Posted by CRGreathouse I see that Dr. Sun solved it on the NMBRTHRY list.
Dr. Sun has solved conjecture #2 and #3 but conjecture #1 remain unsolved:

For any prime p:
d=2*p*j+1 divide M(p)= 2^p-1 if and only if
there exists integers x, y, m and k, with x and y coprime, m and j coprime, mod(y,2) ≠ 0 and mod(m,p) ≠ 0, such that:

for j odd : d= (2^m * x^j + y^j) / k is prime and mod(d,8 )=7

for j even: d= (2^m * x^(2*j) - y^(2*j) ) / k is prime and mod(d,8 )=1

This conjecture can be generalized to Cunningham numbers by replacing base 2 by base b of C= b^p-1
and modifying adequately the modularities of d

Olivier Latinne

March 2nd, 2008, 08:58 PM   #5
Global Moderator

Joined: Dec 2006

Posts: 20,104
Thanks: 1907

I find it odd that o.latinne is using the uncorrected form of his conjecture (both here and elsewhere) even though he seemed to agree 16 days ago in the forum he linked to that the correction given above is needed.

Quote:
 Originally Posted by CRGreathouse I see that Dr. Sun solved it on the NMBRTHRY list.

March 2nd, 2008, 09:23 PM   #6
Global Moderator

Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Ah, no link, where are my manners. Here you go:
http://listserv.nodak.edu/cgi-bin/wa.ex ... &T=0&P=163

Quote:
 Originally Posted by skipjack I find it odd that o.latinne is using the uncorrected form of his conjecture (both here and elsewhere) even though he seemed to agree 16 days ago in the forum he linked to that the correction given above is needed.
Yes, I noticed his similar posts on three other forums.

March 2nd, 2008, 10:29 PM   #7
Senior Member

Joined: Oct 2007
From: Chicago

Posts: 1,701
Thanks: 3

Quote:
http://listserv.nodak.edu/cgi-bin/wa.ex ... &T=0&P=163

Cheers.

March 12th, 2008, 01:40 AM   #8
Newbie

Joined: Feb 2008
From: Brussels

Posts: 3
Thanks: 0

Last Mersenne conjecture solved?

Hi everyone!

Pr Sun provide a demonstration for conjecture #1 of my paper.
Can anyone explain me in details (it's maybe obvious, but not for me) the following transition of that demonstration:
" ... Observe that x^{2j}=2 (mod d) is solvable if and only if 2^p=2^{(d-1)/(2j)}=1 (mod d)."

Best Regards,

Olivier

Quote:
 Dear number theorists, If (j,m)=1, then 1=aj+bm for some integers a and b. If j is even and (j,m)=1, then we also have (2j,m)=1. Thus the latest conjecture of Olivier Latinne can be restated in the following simple form that I will prove. THEOREM. Let p be an odd prime and let d=2pj+1 (0

 Tags conjecture, mersenne, numbers

### "2^p 1" mersenne

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post goodjobbro Number Theory 2 December 1st, 2013 11:38 PM annemarie Number Theory 4 July 25th, 2012 04:56 AM Wickze Number Theory 6 February 10th, 2011 02:13 PM helgamauer Number Theory 11 December 22nd, 2010 06:13 AM Barbarel Number Theory 8 February 15th, 2009 06:30 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top