The Application of Chinese Remainder Algorithm in the Acquisition of the GreatestCommon Divisor from Multivariate Polynomial

The application of Chinese Remainder Algorithm to determine the greatest common divisor of multivariate polynomials is studied Using homostasis mapping, a multivariate polynondal is simplified step by step until only one main variable is left, and the greatest common divisor of the single variable polynomial is obtained by the extended Euclid Algorithm. Then, using the Chinese Remainder Algorithm raises the greatest common divisor from one vari- able to the original multivariate until the real greatest common divisor is gotten. It is an efficient algorithm to solve the greatest coanon divisor of multivariate polynomials.