1) minimal common multiple
最小公倍式
1.
This paper establishes the concept of maximal common factor and minimal common multiple for compound function and proves their unique existence.
证明了等价关系族构成的有界格，建立了函数复合的最大公因式、最小公倍式等概念，并对其存在唯一性作出证明。
2) least common multiple,lowest common multiple(L.C.M)
最小公倍数;最低公倍式
3) least common multiple
最小公倍数
1.
For two integers a,b,one can calculate the greatest common divisor(a,b) ofaandb by using Euclidean algorithm,then the least common multiple[a,b] =(ab/a, b).
利用欧几里得辗转相除法可以计算任意2个整数a,b的最大公约数(a,b),通过[a,b]=(ab/a,b)可以求得a,b的最小公倍数[a,b]。
2.
For any positive integer n,let S(n) denote the Smarandache function,and L(n) be the least common multiple of all positive integers not exceeding n.
对于任意正整数n,用S(n)表示Smarandache函数,L(n)表示不大于n的所有正整数的最小公倍数。
3.
In order to reduce multiplicative operation rates effectively, three DDC structures based on poly-phase filter have been presented in this paper, which are called respectively the postpositional mixer structure, the least common multiple structure and the double frequency conversion structure.
为了有效降低数字下变频器中的乘法速率,在多相滤波的基础上,提出了3种宽带数字下变频器结构,分别是混频器后置结构、最小公倍数结构和二次变频结构。
4) least common multiple
最小公倍子
1.
The least common multiple of several elements in a Euclidean ring;
欧氏环中多个元素的最小公倍子
2.
A united method for greatest common factor and least common multiple in euclidean ring;
欧氏环中最大公因子与最小公倍子的统一求法
5) left least common multiple
左最小公倍
1.
In this paper, it is proved that any couple of matrices over a principal ideal domain (or PID) have a right greatest common divisor and any couple of nonsingular matrices have a left least common multiple, and also, any nonsingular and irreversible matrix over a PID can be expressed as product of finite number of prime matrices.
证明了主理想整环上任一对矩阵均有右最大公因子,任一对非奇异矩阵有左最小公倍,并且证明了主理想整环上任一个非奇异不可逆的矩阵可分解成有限个素矩阵之积。
补充资料：倍式
一个整式能够被另一整式整除，这个整式就是另一整式的倍式。如a2-b2是a＋b和a－b的倍式。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条