Mersenne numbers

[enzocreti]

Am I in the correct place?


Let be p and q two arbitrary Mersenne numbers.


I want a proof that p*q-1 can never be a square.


p*q-1 instead can be a power of 3 as in the cases


3*3-1, 7*31-1 and 127*63-1...in these last cases p*q+1 is an even semi-prime


3*3+1=5*2
7*31+1=109*2
127*63+1=4001*2


Do you believe that another example can be found of Mersenne numbers p and q such that p*q-1 is a power of 3? I don't believe

[Dr Sardonicus]

Originally Posted by enzocreti

Am I in the correct place?


Let be p and q two arbitrary Mersenne numbers.


I want a proof that p*q-1 can never be a square.

You got it. If n is the square of a positive integer, then n is a quadratic residue modulo any prime not dividing n.

If p is a Mersenne number, then p == 3 (mod 4). Therefore, p has at least one prime factor l == 3 (mod 4). [Of course, l = p if p happens to be prime.] Now,

l == 3 (mod 4), so -1 is a quadratic non-residue (mod l).

If n = p*q - 1, then n == -1 (mod l), so n is not a quadratic residue (mod l).

Therefore, p*q - 1 is not a square.

[enzocreti]

1, 8, 216, 8000, 343000, 16003008, 788889024, 40424237568, 2131746903000, 114933031928000, 6306605327953216, 351047164190381568, 19774031697705428416, 1125058699232216000000, 64561313052442296000000 (list; graph; refs; listen; history; text; internal format) A002897
a(n) = C(2*n,n)^3.
(Formerly M4580 N1952)


I dont know what is this sequence and the C function but 8,216 and 8000 are

8=3*3-1
216=7*31-1
8000=63*127-1

so exactly the product of the Mersenne numbers minus one that are a 3rd power.


+30
27

[enzocreti]

interesting is that 7*31+4 has 17=4^2+1 as greatest prime factor and 127*63+4 has 1601=40^2+1 as greatest prime factor