mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 262 Search took 0.04 seconds. Search: Posts Made By: jocelynl
 Forum: Factoring 2016-11-24, 21:18 Replies: 1 Views: 711 Posted By jocelynl 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...
 Forum: Math 2006-10-20, 00:44 Replies: 8 Views: 953 Posted By jocelynl Sorry to have wasted your precious time. this... Sorry to have wasted your precious time. this was my very last post to this forum and won't ever come back. JOSS
 Forum: Math 2006-10-19, 23:52 Replies: 8 Views: 953 Posted By jocelynl here is a revised one 15 M=2 20 ... here is a revised one 15 M=2 20 M=nxtprm(M) 30 N=2^M-1 40 N2=sft(N,-1) 50 B=modpow(3,N2,N) 54 N3=sft(N-N2,-1) 55 B=modpow(B,N3,N) 75 if B=1 then...
 Forum: Math 2006-10-19, 22:17 Replies: 8 Views: 953 Posted By jocelynl another mersenne prime test Here is another Mersenne prime test. I don't know about the speed I only tested it in UBasic upto n=4423 it works fine. 15 M=2 20 M=nxtprm(M) 30 N=2^M-1 40 B=3 50 ...
 Forum: Software 2006-02-06, 15:53 Replies: 11 Views: 702 Posted By jocelynl That P-1 software was a slow working software... That P-1 software was a slow working software using giantint. Perhaps with GIMPS library it could be a addon to LLR. Have you ask Jean if he'd be interested in adding it to his software? And...
 Forum: Software 2006-02-06, 03:59 Replies: 11 Views: 702 Posted By jocelynl Yes Paul, that is excatly what I meant. As the... Yes Paul, that is excatly what I meant. As the numbers grow it will take more and more time to do. It will be kind of stuck at working on the many low digits numbers for a long time. With today's...
 Forum: Software 2006-02-03, 13:21 Replies: 11 Views: 702 Posted By jocelynl I'm talking ram size to analyze the 100 million... I'm talking ram size to analyze the 100 million relations of the recent finds it take in excess of 2GB of ram. But then again the advance in technology may permit to reach higher limits.
 Forum: Software 2006-02-02, 21:41 Replies: 11 Views: 702 Posted By jocelynl actually stage 2 can be run on many cpu's as it... actually stage 2 can be run on many cpu's as it can be separated in ranges. NFS will soon reach the limit of feasablity. ECM will need even more ram to find 60 or 70 digit factors. And most of the...
 Forum: Software 2006-02-02, 11:32 Replies: 11 Views: 702 Posted By jocelynl Also a 2nd issue, when doing stage 2 with a small... Also a 2nd issue, when doing stage 2 with a small amount of ram why not increase by two instead of saving a list of prime steps. I know it's a lot faster your way but also ram agressive. This way we...
 Forum: Software 2006-02-01, 21:33 Replies: 11 Views: 702 Posted By jocelynl P-1 stage 2 on 2 cpu Hi George, Is it in your plan to have P-1 stage 2 run on 2 cpu? In stage 2 I see two seperate process where one count the difference between primes and the other one the product minus the last...
 Forum: Math 2006-02-01, 18:08 Replies: 20 Views: 2,017 Posted By jocelynl I wonder what the probability would be if it were... I wonder what the probability would be if it were random pseudoprime?
 Forum: Math 2006-02-01, 14:12 Replies: 8 Views: 1,707 Posted By jocelynl I find that step 2 is a wast of time since all... I find that step 2 is a wast of time since all your effort are thrown to garbage when you test step 1 a little further. It would be nice if step 2 could test past 2^32 but I'm not complaining. It's...
 Forum: Math 2006-01-18, 03:51 Replies: 0 Views: 339 Posted By jocelynl another p-1 question P-1 usually finds smooth factor with gcd of 3^n! and 2^P-1 ex: p=67 N=2^p-1 a factor of N is 193707721 which 2*2*2*3*3*3*5*67*2677+1 So the gcd of 3^(2*2*2*3*3*3*5*67*2677) and N is...
 Forum: Math 2006-01-08, 16:16 Replies: 8 Views: 1,707 Posted By jocelynl I stand corrected!:redface: I stand corrected!:redface:
 Forum: Math 2006-01-06, 21:20 Replies: 8 Views: 1,707 Posted By jocelynl trial factoring and P-1 When doing P-1 factoring the b1 is actually b1*M suppose we test M=67 to b1=1000 It actually look for factor of the form (2*....*M*b1*M+1) If it is (2*...*M+1) then the factor is found right...
 Forum: GMP-ECM 2006-01-03, 16:44 Replies: 24 Views: 1,797 Posted By jocelynl How about providing a P4 binary of EcmNet 2.7.0... How about providing a P4 binary of EcmNet 2.7.0 and ECM 6.0.1 You would reach 90% of cpu users. Since Prime95 is down many users could turn to EcmNet without the need to build it themself.
 Forum: 15k Search 2005-04-10, 15:02 Replies: 102 Views: 15,963 Posted By jocelynl you must factorize k's larger than 2^32 your... you must factorize k's larger than 2^32 your NewPGen output should like like this after sieving to p=1000000 ABC 3*5*11*11*13*331*487*2^\$b-1 //NewPGen:1000000:M:0:2:322 1 2 1 3 1 4 ... You...
 Forum: 15k Search 2005-04-10, 02:55 Replies: 102 Views: 15,963 Posted By jocelynl You should sieve with NewPgen until you remove 1... You should sieve with NewPgen until you remove 1 k per 2 min or so. Then start testing. Once you are done report them on this forum. Best Regards Joss
 Forum: Riesel Prime Search 2005-03-15, 21:33 Replies: 599 Views: 32,704 Posted By jocelynl 269 264932 is prime! I'm taking this one to... 269 264932 is prime! I'm taking this one to 400k Joss
 Forum: 15k Search 2005-03-14, 08:24 Replies: 102 Views: 15,963 Posted By jocelynl 187466565 now has your name on it! Joss 187466565 now has your name on it! Joss
 Forum: Riesel Prime Search 2005-03-11, 11:25 Replies: 599 Views: 32,704 Posted By jocelynl 251 359790 This is my first 100,000 digits ... 251 359790 This is my first 100,000 digits Joss L15
 Forum: 15k Search 2005-01-20, 16:57 Replies: 102 Views: 15,963 Posted By jocelynl Hi Cedric Nobody's working on it! So it's... Hi Cedric Nobody's working on it! So it's all yours. I'll be waiting for your udpates on this forum Best regards Joss
 Forum: Riesel Prime Search 2005-01-19, 06:00 Replies: 599 Views: 32,704 Posted By jocelynl k=247 is done to 400k and is available - no prime... k=247 is done to 400k and is available - no prime found. Joss
 Forum: Riesel Prime Search 2005-01-15, 05:42 Replies: 599 Views: 32,704 Posted By jocelynl I'm reserving k=247 Joss I'm reserving k=247 Joss
 Forum: 15k Search 2005-01-10, 16:34 Replies: 102 Views: 15,963 Posted By jocelynl Hi Footmaster, Sorry for the late reply. ... Hi Footmaster, Sorry for the late reply. 15k = 954218265, w = 3.78/6616 is now reserved to you best regards Joss
 Showing results 1 to 25 of 262

All times are UTC. The time now is 05:22.

Sun Nov 29 05:22:02 UTC 2020 up 80 days, 2:33, 3 users, load averages: 2.48, 1.85, 1.72