摘要
本文给出计算多个正整数的最大公因子的算法,该算法是Euclid算法的推广,基于该算法可再次发现Guass消元法,而且不必使用多元除算法来简化Buchberger算法.
In this paper, we give an algorithm for computing the greatest common divisor of several positive integers, which can be regarded as the generalization of Euclid＇s algorithm. This enables us to re-find the Guass＇ elimination and simplify Buchberger＇s algorithm without using multivariate division algorithm.
出处
《应用数学》
CSCD
北大核心
2018年第1期148-152,共5页
Mathematica Applicata
基金
Supported by the Science and Technology Project Affiliated to the Education Department of Chongqing Municipality(KJ15012004)
Scientific Research Innovation Team Project Affiliated to Yangtze Normal University(2016XJTD01)
Science and Technology Plan Projects of Fuling Grant(FLKJ2015ABA1031)
