| 求最小公倍式的矩阵变换法 |
| |
| 引用本文： | 李立.求最小公倍式的矩阵变换法[J].齐齐哈尔轻工业学院学报,2010(2):89-91. |
| |
| 作者姓名： | 李立 |
| |
| 作者单位： | 齐齐哈尔大学理学院,黑龙江齐齐哈尔161006 |
| |
| 摘 要： | 根据矩阵的理论,给出了求2个多项式最小公倍式的方法。通过对多项式组成的矩阵进行变换,可使2个多项式最小公倍式的求法变得简单方便,尤其2个多项式的最大公因式可一并求出,更显其优越性。
|
| 关 键 词： | 矩阵变换 多项式 最小公倍式 最大公因式 |
Searching the least common multiple using matrix transformation |
| |
| Authors: | LI li |
| |
| Affiliation: | LI li(Department of Mathematics,Qiqihar University,Heilongjiang Qiqihar 161006,China) |
| |
| Abstract: | On the basis of matrix theory,this paper gives the solution of the least common multiple.Through the transformations of matrix built with multinomials,the solution for the least common multiple is made easy.In addition,the solution shows greater advantages of working out the greatest common factor of two multinomials. |
| |
| Keywords: | matrix translation polynomial the greatest common factor the least common multiple |
| 本文献已被 维普 等数据库收录！ |
|
