关于欧氏环中最大公因子与最小公倍的统一求法  

A United Method for Findng Greatest Common Divisor and Least Common Multiple in a Euclidean Domain

作　　者：陈灵香 谭宜家[1] CHEN Lingxiang;TAN Yijia(College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350108,China)

机构地区：[1]福州大学数学与计算机科学学院,福州350108

出　　处：《鲁东大学学报（自然科学版）》2020年第4期305-311,共7页Journal of Ludong University:Natural Science Edition

基　　金：福建省自然科学基金面上项目(2016J01012)。

摘　　要：研究了欧氏环中元素的最大公因子与最小公倍,利用矩阵的初等变换,给出了欧氏环中多个元素的最大公因子与最小公倍的统一求法。The greatest common divisor and the least common multiple of a finite set of elements in a Euclidean domain were studied in this paper.With the elementary transformations on matrices,a unified method for finding the greatest common divisor and the least common multiple of a finite set of elements in a Euclidean domain was obtained.

关 键 词：最大公因子 最小公倍 矩阵 欧氏环 

分 类 号：O153.5[理学—数学]