求最大公因式的矩阵变换法

Searching the Maximal Common Factor Using Matrix Obversion

求多项式的最大公因式教材中都是运用辗转相除法 ,运算的过程比较复杂。本文介绍的矩阵变换法 ,使求解过程简洁明了 ,尤其对多于2个的多项式的最大公因式可一并求出 ,更显其优越性。

Jacti-division,is often employed in most books to find the maximal common factor of a multinormial,which is very tricky and complex.Here in this article,matrix obversion is presentad which makes the work easier and shows greater advantages of working out the max-common factor of two or more multinomials.