P-1 factoring with Prime95

MatWur-S530113 · 2007-09-21, 21:08

hi,

I have 2 questions about the P-1 factoring of Prime95.

1) Is there a list available similar to PMinus1.txt, how far Mersenne Numbers are P-1-factored with already known Factors? As far as I can see, the exponents are removed from PMinus1.txt if a factor is found, but Prime95 could still be used to search for factors with 'higher smoothness'.

2) After doing a P-1 factoring Prime95 stores a file (without extension, not the *.spl file) to the HD which will be removed after contacting the primenet-server. I saved some of this files. They must contain a number mod M(p) . Someone knows the exact definition for this number? And how to extract it from this file?
(imho this should be a number (r^(2*p))^k! mod M(p), better would be a number (r^(8*p))^k! mod M(p) with k=B1 of the P-1 factoring and r relative prime to 2*M(p). I myself often use r=3 in my proggys).

Thanks in advance for everey help.

greetings

Matthias

jasong · 2007-09-22, 02:53

ECM factoring of Mersenne exponents is implemented in the beta version of Prime95(the new one is version 25, the one in general use now is version 24) through the new not-ready-for-primetime server.

Not sure if P-1 is implemented in the new server.

2007-09-21, 21:08	#1
MatWur-S530113 Apr 2007 Spessart/Germany 2·3⁴ Posts	P-1 factoring with Prime95 hi, I have 2 questions about the P-1 factoring of Prime95. 1) Is there a list available similar to PMinus1.txt, how far Mersenne Numbers are P-1-factored with already known Factors? As far as I can see, the exponents are removed from PMinus1.txt if a factor is found, but Prime95 could still be used to search for factors with 'higher smoothness'. 2) After doing a P-1 factoring Prime95 stores a file (without extension, not the .spl file) to the HD which will be removed after contacting the primenet-server. I saved some of this files. They must contain a number mod M(p) . Someone knows the exact definition for this number? And how to extract it from this file? (imho this should be a number (r^(2p))^k! mod M(p), better would be a number (r^(8p))^k! mod M(p) with k=B1 of the P-1 factoring and r relative prime to 2M(p). I myself often use r=3 in my proggys). Thanks in advance for everey help. greetings Matthias

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Speedup of trial factoring with prime95/mprime	Anonuser	Information & Answers	13	2014-09-09 01:43
Prime95 v24.14 P-1 Factoring problem	harlee	Software	1	2006-12-19 22:19
How do I interpret Prime95 factoring benchmarks?	jasong	Hardware	1	2006-10-23 12:08
P-1 factoring in prime95	nucleon	Math	5	2003-08-03 01:09

2007-09-22, 02:53	#2
jasong "Jason Goatcher" Mar 2005 DB3₁₆ Posts	ECM factoring of Mersenne exponents is implemented in the beta version of Prime95(the new one is version 25, the one in general use now is version 24) through the new not-ready-for-primetime server. Not sure if P-1 is implemented in the new server.