![]() |
|
|
#1156 |
|
Sep 2002
17×47 Posts |
P-1 found a factor in stage #1, B1=665000.
UID: Jwb52z/Clay, M79429249 has a factor: 1841618282000258891653289 (P-1, B1=665000) 80.607 bits. |
|
|
|
|
|
#1157 |
|
Sep 2003
5·11·47 Posts |
M5233 /2913486798065813495660442702490836503/32101013028243569/9223417954129/93603692660420120110355562102857/994271
is a new probable prime. |
|
|
|
|
|
#1158 | |
|
Romulan Interpreter
Jun 2011
Thailand
26×151 Posts |
Quote:
I know that Dario already parsed this range, and it was no PRP there, therefore it means a new factor was found. It can only be the biggest in your line. Did you find the new factor by yourself? Congratulations for the new factor, whoever found it. edit, indeed this is new. I marked in red to be easy to see and inserted some spaces into that line Last fiddled with by LaurV on 2016-09-29 at 02:03 |
|
|
|
|
|
|
#1159 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,497 Posts |
Yes, it is new. Good find! You can email to S.S.W for extension tables.
[URL]http://primes.utm.edu/primes/search.php?Advanced=1[/URL] (use Official Comment=Mersenne cofactor, type=all, Maximum Number of Primes = 2000) => not there Also: dated [URL="http://factordb.com/index.php?id=1100000000869501428"]Sep 29[/URL] in factordb.com |
|
|
|
|
|
#1160 | |
|
Nov 2008
3·167 Posts |
Quote:
Let's not reopen the PRP debate right now. |
|
|
|
|
|
|
#1161 | |
|
Romulan Interpreter
Jun 2011
Thailand
26·151 Posts |
Quote:
Or you want to say that a ~1500 digits number is difficult to prove prime (or composite), with the hardware and the algorithms we have today? |
|
|
|
|
|
|
#1162 | |
|
Sep 2003
5·11·47 Posts |
Quote:
I think the "debate" is about whether a probable prime cofactor means an exponent is truly "fully factored" or not. There was an old thread where people spent dozens of pages arguing vehemently over it. In this case it's a moot point, since this particular prime is easily within range of formal provability using primality certificates issued by primo or similar program. A few weeks ago I started doing ECM on very small exponents with already known factor(s). Currently taking the M5000 range to B1=3,000,000 (i.e., "40 digits"), which means a few thousand curves per exponent. So far I've found new factors for M4957, M5023, and M5233 (the latest result). This has been just using Prime95, without GMP-ECM, but I will soon try that for stage 2. Machines have gotten faster over the years and the time seems ripe to revisit this range in a thorough and systematic way. People have been throwing a lot of effort at the very stubborn M12xx holdouts, but there is some low-hanging fruit in the higher single-digit-thousands range. So far I've been using only one core of a machine that's a few years old, but encouraged by this PRP result, I'm going to throw some more cores at it in the cloud. I've also been doing some ECM on already-factored exponents in the 40K and 50K ranges. The most tedious part is creating the "known factors" string at the end of the ECM2= line, but I have a Python script that automates that. Last fiddled with by GP2 on 2016-09-29 at 14:21 |
|
|
|
|
|
|
#1163 |
|
Sep 2002
17×47 Posts |
P-1 found a factor in stage #1, B1=665000.
UID: Jwb52z/Clay, M79423907 has a factor: 2357613551541984781291234249 (P-1, B1=665000) 90.929 bits. |
|
|
|
|
|
#1166 |
|
"Graham uses ISO 8601"
Mar 2014
AU, Sydney
35 Posts |
I noticed that result also.
Impressive. Plenty of bits. |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| A new factor of F11?! | siegert81 | FermatSearch | 2 | 2018-01-24 04:35 |
| A fond farewell | rogue | Lounge | 10 | 2008-11-21 05:25 |
| who can factor 10^100+27? | aaa120 | Factoring | 17 | 2008-11-13 19:23 |
| New factor | fivemack | ElevenSmooth | 4 | 2008-05-07 19:28 |
| Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |