![]() |
|
|
#672 |
|
Oct 2007
Manchester, UK
5×271 Posts |
My largest SNFS factorisation to date, c228 = p88 * p141
|
|
|
|
|
|
#673 | |
|
Jan 2018
3310 Posts |
Quote:
How long did it take to complete that? |
|
|
|
|
|
|
#674 |
|
Oct 2007
Manchester, UK
101010010112 Posts |
25 days on a 3.4 Ghz quad core. I think that's a pretty good time for a number with SNFS difficulty 234, those p^7-1 numbers have great degree 6 polynomials that sieve super well.
|
|
|
|
|
|
#675 |
|
Jan 2018
3·11 Posts |
I just found a P48 factor for (101691318335746946042200793713846391^7-1) so I think the C143 that's left should be easy enough to finish off.
|
|
|
|
|
|
#676 |
|
Jan 2018
2116 Posts |
I wanted to give everyone a monthly update on the ECM status of the composites in the t2100 file. I'm still running 35 digit ECM on the C130-C199 composites and I should have that finished in a little over a week. After that I'm planning on running the following tasks:
C200 - C299 at 30 digits: ~9000 composites C130 - C139 at 40 digits: ~110 composites You can find my code and the snapshot of the t2100 file that I'm working with at https://gitlab.com/hyramgraff/odd-perfect-ecm. Every time I update my snapshot of the t2100 file, I run the following tasks on the new composites: 25 digit ECM for all composites 30 digit ECM for C130 - C199 |
|
|
|
|
|
#677 |
|
Oct 2007
Manchester, UK
5×271 Posts |
For what it's worth, I've performed a lot of ECM on the c251 in 1631830528533060342008861^13-1. Unless I've been somewhat unlucky, I'm now fairly sure it has no factors less than 55 digits. I'm currently looking around the 65 digit level, and soon to be 70 digit level.
|
|
|
|
|
|
#678 |
|
Sep 2008
Kansas
24×211 Posts |
Around 200 new composites have been added to the MWRB file between sizes C131-C189. Many are of the SNFS flavor. Use your favorite tool to find the ones you might like or request a range and I can post some here.
I am reserving the following numbers (in no particular order): Code:
55667^37-1 509^73-1 14821^53-1 45427^37-1 33329911692062219289866143679653390355732583233312231696104296093313266337 ^3-1 (P74^3-1) 12948^11-1 383^73-1 |
|
|
|
|
|
#679 |
|
Sep 2008
Kansas
24·211 Posts |
Taking next.
Code:
14755578513200128694405527268494894972322250111221828730338500819651^3-1 3870372610603^13-1 |
|
|
|
|
|
#680 |
|
Sep 2008
Kansas
1101001100002 Posts |
Taking all the remaining C13x in the MWRB file.
|
|
|
|
|
|
#681 |
|
Sep 2008
Kansas
24×211 Posts |
Starting on the C14x's in the MWRB file. Not to worry, there are still about 140 composites in the range C150-C189.
|
|
|
|
|
|
#682 | |
|
Jan 2018
3·11 Posts |
Quote:
You can find my code and the snapshot of the t2100 file that I'm working with at https://gitlab.com/hyramgraff/odd-perfect-ecm. Every time I update my snapshot of the t2100 file, I run the following tasks on the new composites: 25 digit ECM for all composites 30 digit ECM for C130 - C399 (up from C199 in the last report) 35 digit ECM for C130 - C199 (added since the last report) 40 digit ECM for C130 - C149 (added since the last report) Mildly interesting factorization of the month: C139 = P41 * P44 * P55 (both factors found at B1 = 45 digits http://factordb.com/index.php?id=1100000000537424706) Question: What's a good upper limit for running ECM on smaller composites? 45 digits for n <= 139? 50 digits for C140 <= n <= C159? 55 digits for C160 <= n <= 179? |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Passive Pascal | Xyzzy | GPU Computing | 1 | 2017-05-17 20:22 |
| Tesla P100 — 5.4 DP TeraFLOPS — Pascal | Mark Rose | GPU Computing | 52 | 2016-07-02 12:11 |
| Nvidia Pascal, a third of DP | firejuggler | GPU Computing | 12 | 2016-02-23 06:55 |
| Calculating perfect numbers in Pascal | Elhueno | Homework Help | 5 | 2008-06-12 16:37 |
| Factorization attempt to a c163 - a new Odd Perfect Number roadblock | jchein1 | Factoring | 30 | 2005-05-30 14:43 |