Optimize the above algorithm:

The power of (1) variable x is arranged in descending order, and it can be completely omitted as long as it corresponds to a good position, that is,

(2) In-column observation -5,-12? It's just that every time you fall repeatedly, compress the useful numbers to avoid this repeated decline and get it.

(3) continue to optimize, factor x-3? The corresponding root is 3. Put -3 in (2)? Change it to 3? Replacing the original vertical "difference" with "sum" is also equivalent to multiplying by-1? Change the sign, get

As a result, the following two, three and four? Combined with the corresponding x power,

This is the "comprehensive score".

reference data

Zhihu: /p/308 15738