Mersenne(prime exponents) factorization

[science_man_88]

I found that floor((2^p-1)/p^2) is the multiplication of all 2*k values possible for any unlimited number of factors if such exist. I realize why this is true but I want to try and get it more specific to find k values that are the true k values needed.

[cmd]

python

p=2**13-1
k=p*p
while 1:
 print(k)
 k+=p*10

(try)

[science_man_88]

Originally Posted by cmd

python

p=2**13-1
k=p*p
while 1:
 print(k)
 k+=p*10

(try)

it's been so long I can't remember how I got it but I can safely say that's not it.

[cmd]

Originally Posted by cmd

python

p=2**13-1
k=p*p
while 1:
 print(k)
 k+=p*10

p=2**17-1
k=p*p
while 1:
 print(k)
 k+=p*10

(retry)

follow music