mersenneforum.org Mersenne(prime exponents) factorization
 Register FAQ Search Today's Posts Mark Forums Read

 2010-09-19, 16:15 #1 science_man_88     "Forget I exist" Jul 2009 Dumbassville 838410 Posts 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.
 2010-10-13, 14:16 #2 cmd     "(^r'°:.:)^n;e'e" Nov 2008 ;t:.:;^ 23·53 Posts python Code: p=2**13-1 k=p*p while 1: print(k) k+=p*10 (try)
2010-10-13, 14:21   #3
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by cmd python Code: 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.

2010-10-13, 14:32   #4
cmd

"(^r'°:.:)^n;e'e"
Nov 2008
;t:.:;^

23×53 Posts
single piece

Quote:
 Originally Posted by cmd python Code: p=2**13-1 k=p*p while 1: print(k) k+=p*10
Code:
p=2**17-1
k=p*p
while 1:
print(k)
k+=p*10
(retry)

 Similar Threads Thread Thread Starter Forum Replies Last Post biwema Math 10 2021-11-28 04:05 paulunderwood Miscellaneous Math 15 2016-01-23 20:53 ProximaCentauri Miscellaneous Math 22 2014-12-05 13:07 davar55 Puzzles 8 2009-08-22 19:14 Xordan Math 4 2007-06-07 16:05

All times are UTC. The time now is 09:20.

Thu Jan 27 09:20:15 UTC 2022 up 188 days, 3:49, 1 user, load averages: 1.50, 1.54, 1.48