Introduction - If you have any usage issues, please Google them yourself
The Chinese Remainder Theorem for Polynomials is defined in
still more mathematical notations in literature as follows
(for eg, in the book by Richard Blahut/P77) :
For any set of Pair-wise Coprime Polynomials [m1(x), m2(x), ... mk(x)],
the set of congruences :
c(x) =eqvt mod ( ck(x), mk(x) ), k = 1, 2, ... k
has a unique solution of a degree less than the degree
of M(x) = prod (m1(x), m2(x), ... mk(x)), given by :
c_soln_Poly(x) = sum ( mod ( ck(x).Nk(x).Mk(x), M(x) ) )
where Mk(x) = M(x)/mk(x), and Nk(x) is the Polynomial that satisfies
Nk(x).Mk(x)+ nk(x).mk(x) = GCD = 1
(this is where we need to use my programmes Poly_GCD.m and Poly_GCD_Main.m)