![]() |
![]() |
#254 |
May 2007
Kansas; USA
13·853 Posts |
![]()
OK here is my "secret" (lol):
I was partially joking about the formulas, although not entirely. I do apply a score. The main key is that I take a snapshot of your sequences each day in the early afternoon. Then I know what has been added or changed. I then do an (almost) full ECM/factorization (to 30% or t35, whichever is smaller) on all of the ones that have been updated until they hit a "hard" cofactor > C110. I then have a spreadsheet that applies the following score to all of the sequences looking for the lowest lying fruit: size + 2 * cofactor length - log (smallest factor) + if smallest factor = 3, +5, else 0. Of course lower score is better. I found that the smallest factor of 3 is hard to break hence the penalty. Smallest factors of 5, 7, 11 don't seem so tough so no adjustment. This is kind of interesting when there is no factor known. For instance on 60^86 that is a 137/137, as per above I ECM'd it to t35. So I just use 1e35 for the smallest factor size. The doubling of the 137 cofactor length makes it mostly untenable score-wise for me even with the reduction of 35 from the log of the smallest factor. This only works if you've mostly fully ECM'd the latest iteration on all of the sequences. Otherwise the ones that have not been ECM'd will appear tougher than they really are. This score is kind of a "difficulty rating" for terminating a sequence. It can probably be improved upon. I have already done a few changes to it. The most recent addition was to add 5 when the lowest factor was 3. That seemed to help quite a bit. I kept getting stuck on tough ones where the factor of 3 would not go away. So...I just run the ones that have been updated and sometimes that alone with terminate them. With what is left I work top-down from lowest score. It is an iterative process. Many times I'll take one with lowest score and it will hit a larger hard cofactor. If the hard cofactor becomes > C120 I usually stop it because the score has become much greater. I'll then move on to the one with the now lowest score. Last fiddled with by gd_barnes on 2022-06-01 at 21:25 |
![]() |
![]() |
![]() |
#255 |
May 2007
Kansas; USA
13×853 Posts |
![]()
95^77 terminates
|
![]() |
![]() |
![]() |
#256 |
May 2007
Kansas; USA
13·853 Posts |
![]()
85^79 terminates
This was a slog. It quickly dropped into the low 120's making it look like a quick one. It then picked up the factor 3, which remained for ~50 iterations from size 122 to 106. Finally the 3 dropped and it terminated quickly after that. Last fiddled with by gd_barnes on 2022-06-02 at 07:28 |
![]() |
![]() |
![]() |
#257 |
"Ed Hall"
Dec 2009
Adirondack Mtns
4,691 Posts |
![]()
I have a few different things I do to choose which sequences to bring down, as well. I look for those that have no small factors because those will likely fall several digits. And, I look for those bases with one or two sequences left. While the list is lengthy, I will toss in some larger composites or work those last holdouts.And, I have a smaller GPU that I will set up with a second machine (for stage 2 residues) to run through a set of sequences looking for ECM hits, similar to what you're doing,
I'm afraid this thread may have lost some interest since I moved to a threshold of 145 digits, But, there are still many smaller sequences left, so maybe it's due to summer approaching. |
![]() |
![]() |
![]() |
#258 |
May 2007
Kansas; USA
2B5116 Posts |
![]()
113^71 terminates
|
![]() |
![]() |
![]() |
#259 |
May 2007
Kansas; USA
13×853 Posts |
![]()
151^61 and 1250^42 terminate
|
![]() |
![]() |
![]() |
#260 |
May 2007
Kansas; USA
255218 Posts |
![]()
1152^48 terminates
|
![]() |
![]() |
![]() |
#261 |
"Rich"
Aug 2002
Benicia, California
155110 Posts |
![]()
Taking 57^85
|
![]() |
![]() |
![]() |
#262 |
May 2007
Kansas; USA
13·853 Posts |
![]()
131^71 terminates
|
![]() |
![]() |
![]() |
#263 |
"Rich"
Aug 2002
Benicia, California
3·11·47 Posts |
![]()
57^85 terminated by me.
Taking 6^200 |
![]() |
![]() |
![]() |
#264 |
"Rich"
Aug 2002
Benicia, California
3×11×47 Posts |
![]()
Well, that was quick: 6^200 terminated by me.
Taking 53^99 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Unexpected termination of PM-1 | Miszka | Software | 22 | 2021-11-19 21:36 |
Easier pi(x) approximation | mathPuzzles | Math | 8 | 2017-05-04 10:58 |
Would finding a definate Pi value easier if... | xtreme2k | Math | 34 | 2013-09-09 23:54 |
Aliquot Termination Question - Largest Prime? | EdH | Aliquot Sequences | 6 | 2010-04-06 00:12 |
A new termination below 100k | 10metreh | Aliquot Sequences | 0 | 2010-03-11 18:24 |