A new method to solve the greatest common factor of one variable polynomials is proposed.
给出一种求解一元多项式的最大公因式新方法。
Only the resultant matrix is needed to solve the greatest common factor of polynomials...
该方法仅利用结矩阵便可求得多项式的最大公因式。
Thus we gave a kind of new method for solving the greatest common factor of two-variable polynomials.
利用矩阵的初等变换，给出了两个多项式的最小公倍式、最大公因式及其系数多项式的统一求法。
Generally speaking division algorithm and factor resolution can be used to find the greatest common factor of the two multinomial.
摘要求两个多项式的最大公因式，可以用辗转相除法及分解因式法。
The greatest common divisor, also known as the greatest common factor, the most common factor, refers to two or more integers have one of the biggest in a few.
最大公约数，也称最大公因数、最大公因子，指两个或多个整数共有约数中最大的一个。
This paper first gets definition and theorems of integers matrices, and then to discusses a new method to find the greatest common factor of integers and solves linear indeterminate equation.
首先给出了整数矩阵的定义及性质，然后讨论了它在求整数的最大公因数和解整系数不定方程中的应用。
This paper first gets definition and theorems of integers matrices, and then to discusses a new method to find the greatest common factor of integers and solves linear indeterminate equation.
本文给出利用矩阵初等变换求一组整数的最大公因数，以及把它表示成这组数的组合的一个方法，此法常比一般“初等数论”教材中所给方法简单。
In this paper we get a seeking unified method of the least common multiple the greatest common factor and coefficients polynomial by implementing elementary row transformation in a polynomial matrix.
利用矩阵的初等变换，给出了两个多项式的最小公倍式、最大公因式及其系数多项式的统一求法。
This paper gives a proof of a conjecture on the relation between the greatest common divisor matrix and the factor closed set under a certain condition.
本文在一个较弱的条件下证明了关于最大公因子矩陈与因子封闭集的关系的一个猜想。
This paper gives a proof of a conjecture on the relation between the greatest common divisor matrix and the factor closed set under a certain condition.
本文在一个较弱的条件下证明了关于最大公因子矩陈与因子封闭集的关系的一个猜想。
应用推荐