摘要
辗转相除法是求最大公因式最重要的方法,但过程比较复杂,将辗转相除法总结成统一公式,并通过列表法予以标识,简化了用辗转相除法求最大公因式过程中相关多项式的求解过程。
Division algorithm is the most important method of seeking the greatest common divisor,but the process is more complicated.This article summarizes the Euclidean algorithm into a unified formula,and expressed by list method. This method simplifies the process of solving the relevant polynomial in the process of finding the greatest common divisor by the division algorithm.
出处
《安康学院学报》
2018年第1期107-109,共3页
Journal of Ankang University
关键词
辗转相除法
统-公式
最大公因式
division algorithm
unified formula
the greatest common factor