摘要
研究了欧氏环中元素的最大公因子与最小公倍,利用矩阵的初等变换,给出了欧氏环中多个元素的最大公因子与最小公倍的统一求法。
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.
作者
陈灵香
谭宜家
CHEN Lingxiang;TAN Yijia(College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350108,China)
出处
《鲁东大学学报（自然科学版）》
2020年第4期305-311,共7页
Journal of Ludong University:Natural Science Edition
基金
福建省自然科学基金面上项目(2016J01012)。
关键词
最大公因子
最小公倍
矩阵
欧氏环
greatest common divisor
least common multiple
matrix
Euclidean domain
