最大公约数
- 名greatest common divisor
-
[greatest common divisor] 两个或两个以上数的几个公约数中最大的一个公约数
-
12和6的公约数2与3中,3是最大公约数
-
由此产生的杂散谱可根据DDS的频率控制字和2N的最大公约数进行分类,N是DDS相位累加器的字长。
The spurious lines caused by those sources can be classified into different sets according to the greatest common divisor of the DDS frequency control word ( FCW ) and 2 N , where N is the word length of the DDS phase accumulator .
-
和30的最大公约数为6。
The greatest common divisor of 24 and 30 is 6 24 .
-
最大公约数与最小公倍数的k次和函数
The K-th Power Sum Functions of GCD and LCM
-
模运算及求最大公约数的增广PETRI网模型
Two extended Petri net models for implemetation of modulus and finding maximum common divisor
-
分别使用Euclid算法和扩展Euclid算法求解最大公约数和模逆。
Greatest common divisor and modular inversion are resolved with Euclid algorithm and extended Euclid algorithm , respectively .
-
最大公约数线性表达式系数的求解问题
The Problem of Finding the Coefficients for the Linear Expression of the Greatest Common Divisor
-
给出了用其整系数线性组合表示两个正整数的最大公约数的计算机程序。
A computer program for expressing the greatest common divisor of two positive integers using their linear combination is given here .
-
该文所用的证明方法是基于二维槽号相位图、单元绕组和最大公约数法则。
The proof method used in this paper is based on two-dimension slot-number phase diagram , unit winding , and the maximum common divided principles .
-
若总槽数和极对数之间具有最大公约数t,则整个绕组就可分成t个完全相同的单元。
When the maximum common factor of overall number of slots and pole pairs is t , the whole winding can be separated into t same units .
-
设计出了基于C/C++语言最大公约数算法程序,通过分析算法,提出了程序设计语言教学的几点建议。
Based on C / C + + language the author devises programs of positive integer greatest common divisor algorithms . By analyzing algorithms , the author presents some suggestions of programming language teaching .
-
这些原则体现了亚洲国家处理复杂矛盾的智慧,反映了各国利益的最大公约数,可谓来之不易,也为本地区合作的兴盛和经济的繁荣提供了不可或缺的条件。
These principles reflect the wisdom of Asian countries in handling complicated problems and represent the biggest common interests of all countries . These hard-won principles have provided indispensable conditions for the robust cooperation and economic prosperity in this region .