>
|
|
Define a ring of polynomials.
>
|
|
Define two polynomials of R.
Compute their subresultant chain
>
|
|
| (4) |
We can choose different encodings to the computed subresultant chain
>
|
|
| |
| (5) |
>
|
|
| |
| (6) |
Note that ByValues representation is used only for modpn ring.
>
|
|
>
|
|
| |
| (7) |
Extract the last non-zero subresultant
>
|
|
| (8) |
which is also the subresultant of index 0 in this example
>
|
|
| (9) |
Define a regular chain with res. Note that res is not required to be irreducible or even square free.
>
|
|
Compute a regular GCD of f1 and f2 modulo rc
>
|
|
| (13) |