![]() |
|
|
#397 | |
|
Nov 2010
Germany
3×199 Posts |
Quote:
1163264 - 1179648 2326528 - 2359296 4653056 - 4718592 9306112 - 9437184 18612224 - 18874368 37224448 - 37748736 74448896 - 75497472 148897792 - 150994944 297795584 - 301989888 595591168 - 603979776 1191182336 - 1207959552 2382364672 - 2415919104 Searching for barrett15_75 and mfakto_cl_71 with "to 2^71" or below is sufficient (these kernel names are unique to mfakto). I've analyzed the bug thoroughly, also with respect to the other kernels and their limits. I did not find any further way to make the precomputing overflow the modulus, so to the best I can tell: this is it. The problem is fixed and the fix being tested (I'll send it around to the testers later). |
|
|
|
|
|
|
#398 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
9,767 Posts |
Quote:
![]() All of your specified ranges below 74,448,896 have been completed, and only the following match your specs: Code:
,History,no factor for M2328107 from 2^61 to 2^62 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2011-11-30 ,History,no factor for M2330837 from 2^61 to 2^62 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2011-11-30 ,History,no factor for M2346413 from 2^61 to 2^62 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2012-01-23 ,History,no factor for M2346413 from 2^62 to 2^63 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2012-01-23 ,History,no factor for M2346413 from 2^63 to 2^64 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2012-01-23 ,History,no factor for M2355799 from 2^61 to 2^62 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2012-01-23 ,History,no factor for M2355799 from 2^62 to 2^63 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2012-01-23 ,History,no factor for M2355799 from 2^63 to 2^64 [mfakto 0.08-Win mfakto_cl_71] by "lycorn" on 2012-01-23 There are also a few matches for "mfakto_cl_71_4" up in the 601M range. I'll report on that (and any other Spidy finds) once the other (much larger) ranges complete. |
|
|
|
|
|
|
#399 | ||
|
Nov 2010
Germany
3×199 Posts |
Quote:
Quote:
Thanks a lot for your help, and also big thank you to dabaichi and Axelsson for finding and reporting the bug! |
||
|
|
|
|
|
#400 |
|
Jul 2012
Sweden
528 Posts |
The probability to trigger this bug is one in 128 and only with some distinct factoring depths... so what was the probability that I would run into it?
People that knows me know that with me in the mix the possibility to trigger the bug is close to unity! I like to experiment. I break every program I get close to. ![]() ![]() Thanks for fixing the code so fast! /Göran |
|
|
|
|
|
#401 |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
9,767 Posts |
OK. Spidy has found 691 up in the 601M range (all by Axelsson). Nothing else (yet) in the other ranges.
How did you want to handle this Bdot? Would it help if I sed'ed them into "Factor=..." assignment lines, and PM them to you? Or did you want the raw results lines? |
|
|
|
|
|
#402 |
|
Jul 2012
Sweden
2×3×7 Posts |
It seems proper that I should rerun the results I reported. I already have an assignment list of the factors ready to feed to mfakto.
But maybe Bdot wants to double check it against mfaktc. /Göran |
|
|
|
|
|
#403 | ||
|
Nov 2010
Germany
3×199 Posts |
Quote:
Quote:
Göran, thanks a lot for helping me with this ... I'll send you the fixed binary soon - I'd like to run these test with both mfakto and mfaktc, just to be sure. |
||
|
|
|
|
|
#404 | |
|
Jul 2012
Sweden
528 Posts |
Hi Chalsall
Quote:
I've sent a list to Bdot already. If you can send me a raw list with numbers only then I can compare it with mine and see if there is any difference. /Göran Last fiddled with by Axelsson on 2012-07-10 at 20:55 |
|
|
|
|
|
|
#405 |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
9,767 Posts |
|
|
|
|
|
|
#406 |
|
Jul 2012
Sweden
4210 Posts |
Done!
I've re-run all the candidates I tested with mfakto 0.11 earlier and with the new 0.12 code I found 19 factors, two already known. I even think the new program is a bit faster than the old one. /Göran |
|
|
|
|
|
#407 |
|
Feb 2012
34×5 Posts |
M67389239 has a factor: 1389239703570981962393
k = 2^2 * 7 * 11 * 233 * 143631601 = 10307578214164 |
|
|
|
![]() |
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 |