Mersenne(prime exponents) factorization
 

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.

[URL="http://www.youtube.com/watch?v=S0z1Mo7O6dE"]python[/URL]

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

[/code]

(try)

[QUOTE=cmd;233314][URL="http://www.youtube.com/watch?v=S0z1Mo7O6dE"]python[/URL]

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

[/code]

(try)[/QUOTE]

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

single piece
 

[QUOTE=cmd;233314][URL="http://www.youtube.com/watch?v=S0z1Mo7O6dE"]python[/URL]

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

[/code]

[/QUOTE]

[code]
p=2**17-1
k=p*p
while 1:
print(k)
k+=p*10
[/code]

(retry)

follow music