摘要
文[1]利用整数初等变换,仅研究了两个整数的最大公约数与最小公倍数的问题,略显不够深入。在此基础上,通过构造整数矩阵,以矩阵的整数初等变换为工具,得到了求m(m>2)个整数的最大公约数与最小公倍数的方法。
The article [1]makes use of integer elementary operation,has only studied two integer greatest common divisors and the least common multiple number question,reveals slightly insufficiently thoroughly.In this foundation,through the structure integer matrix,take the matrix integer elementary operation as the tool,obtained has asked （ ） the integer greatest common divisor and the least common multiple number method.
出处
《攀枝花学院学报》
2009年第6期73-75,共3页
Journal of Panzhihua University
基金
河南省教育厅自然科学基础研究项目
基金编号:2008B12006
关键词
矩阵
整数矩阵
初等变换
最大公约数
最小公倍数
matrix
integer matrix
elementary operation
greatest common divisor
least common multiple number
