mersenneforum.org GPU and Random P-1
 Register FAQ Search Today's Posts Mark Forums Read

 2016-11-24, 21:18 #1 jocelynl   Sep 2002 2×131 Posts GPU and Random P-1 Has anyone ever done any work on random P-1 3random 0's and 1's@(2p-1) Where every n iteration you do a GCD (B-1,2p-1) Now that there are many thousands GPU working on distributed computing. (working at B1 level only would not take that much RAM.) Now that many numbers are out of reach of NFS or even ECM. Would that be an avenue? or is too much of a lottery just to find one. Last fiddled with by jocelynl on 2016-11-24 at 21:19
 2016-11-25, 05:14 #2 LaurV Romulan Interpreter     Jun 2011 Thailand 25·5·59 Posts There are many "extensions" of P-1. You still need the small terms, with all their powers, in your random expression, because many numbers (i.e. the "q-1" in "q is a prime that divides m=2^p-1, with prime p") have lots of small factors. You may, for a random base b which is not a power of 2, compute $$c=b^E$$, where $$E$$ is the product we use in stage 1 of P-1, then you can try to do the GCD phase after a couple of iterations $$c_i=c_{i-1}^{random\cdot big\cdot number}$$. The chances are slim, but you may get lucky, and $$gcd(c_i-1,m)$$ reveal a factor of m, or m itself (in which case a factor can be found by "backtracking"). Last fiddled with by LaurV on 2016-11-25 at 05:21

 Similar Threads Thread Thread Starter Forum Replies Last Post MattcAnderson Puzzles 13 2017-06-30 15:15 jasong Lounge 46 2017-05-09 12:32 jnml Miscellaneous Math 9 2014-04-28 20:43 Greenk12 Factoring 1 2008-11-15 13:56 Bundu Lone Mersenne Hunters 0 2007-10-01 01:17

All times are UTC. The time now is 03:39.

Sun May 9 03:39:35 UTC 2021 up 30 days, 22:20, 0 users, load averages: 0.99, 1.32, 1.53