![]() |
|
|
#1 |
|
Apr 2007
Spessart/Germany
2×34 Posts |
Hello,
at the moment I want to run some Elliptic Curves on M-numbers with known factors. Is there a possibility to tell prime95 about the already known factors? With GMP-ECM I simply divide out already known factors in the input file, f.e. (2^1051-1)/3575503 but I don't see a similary way for prime95. Thank You for every help, Matthias |
|
|
|
|
|
#2 |
|
"Nancy"
Aug 2002
Alexandria
9A316 Posts |
Create a file "lowm.txt" for 2^n-1 numbers with content like e.g.
M( 123 )C: 456 if the number 2^123-1 had the factor 456. For 2^n+1 numbers, make a file "lowp.txt" and start the line with P instead of M. If the files are in the Prime95 working directory, it scans them for known factors when it starts P-1 or ECM. Alex |
|
|
|
|
|
#3 |
|
Apr 2007
Spessart/Germany
2·34 Posts |
Thank you Alex, very appreciatet. I will test it immediately.
best regards (and Merry Christmas to all), Matthias |
|
|
|
|
|
#4 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
753710 Posts |
lowm.txt is no longer the preferred way of doing this.
Put in worktodo.txt: ECM2=k,b,n,c,B1,B2,curves_to_do[,specific_sigma,B2_start][,"factors"] where factors is a comma separated list of known factors |
|
|
|
|
|
#5 | |
|
May 2008
3·5·73 Posts |
I confirm the lowm.txt file works with mprime 25.6 and earlier versions at least. I haven't used newer versions yet (is it being dropped?). Monday I found this 38 digit ECM factor:
Quote:
![]() Good luck on your search. |
|
|
|
|
|
|
#6 | |
|
Apr 2007
Spessart/Germany
2×34 Posts |
Hello again,
Quote:
@ Jayson King I saw this factor in the 'recent cleared' list on monday, what a monster, congratulations ![]() If I remember right you already found a 41-digit factor some days before (exponent range ~ 10000)... could you play lotto for me next week? ![]() best regards, Matthias |
|
|
|
|
|
|
#7 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
7,537 Posts |
It is not being dropped. However, when ECMing k*b^n+c it only works if k=1, b=2, and c=-1. The worktodo.txt approach can handle all cases.
|
|
|
|
|
|
#8 |
|
"Nancy"
Aug 2002
Alexandria
1001101000112 Posts |
I should add: if you use the low[mp].txt file, you can have several lines for the same input number. So when you find another factor and want to continue factoring the cofactor, you don't need to multiply the known factors up to put them in a single line - just add another line with the new factor. Plus, iirc, the exponents must be in non-decreasing order; i.e., i think Prime95 stops scanning lowm.txt for factors once it reads an exponent greater than the one it's trying to factor.
Alex |
|
|
|
|
|
#9 | |
|
May 2013
Poland
10100012 Posts |
Quote:
For example M118297 has known factors: 1892753, 3568547303, 404339666506801 and composite factors: 6754378613395159, 765315116799747113153, 1442905226408764139707703 and 2731063196000867551724173976359 Which to put in "factors"? |
|
|
|
|
|
|
#10 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
251616 Posts |
Just the prime factors: "1892753,3568547303,404339666506801"
Or their product - this will work too: "2731063196000867551724173976359" |
|
|
|
|
|
#11 | |
|
May 2013
Poland
34 Posts |
Quote:
ECM2=1,2,119923,-1,50000,5000000,27,"1918769,8047312993,5783659875377" result "M119923 has a factor: 46542921262214092873361, AID: 9D7EF7410F11BDE1323E8C229717E099 PrimeNet success code with additional info: Composite factor 46542921262214092873361 = 8047312993 * 5783659875377 Already have factor 8047312993 for M119923 Already have factor 5783659875377 for M119923" What is wrong? |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Does anyone track factors for Bernoulli numbers? | VBCurtis | And now for something completely different | 1 | 2015-02-08 02:45 |
| what's the meaning of the numbers in the FACTORS.CMP | wreck | Software | 2 | 2006-08-30 04:46 |
| Random numbers and proper factors | mfgoode | Math | 20 | 2006-02-05 02:09 |
| Factors of Mersenne Numbers | asdf | Math | 17 | 2004-07-24 14:00 |
| Factors of Mersenne numbers ? | Fusion_power | Math | 13 | 2003-10-28 20:52 |