Recent content by o.latinne

a demonstration for the particular case j=4 of conjecture #3 has also been found

for p=13, d=79 but mod(2^13-1)%79=54 so d=79 is not a divisor of 2^13-1 So, it is not a counter example !

Hi everyone! 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...