• 基本释义

1.common divisor
公约数收藏指正
2.Right Greatest Common Divisor of Matrices over Euclidean Ring
Euclid环上矩阵的右最大公因子收藏指正
3.6 is a common divisor of 6, 12, and 36.
6是6、12和36的公约(数)。收藏指正
4.In this paper,An improved Euclidean algorithm for computing the greatest common divisor of two polynomials is presented. We improve the recursive procedure EMGCD to determine the computational complexity of Euclidean algorithm.
本文对用于求两个多项式的最大公约多项式的欧几里德算法作了改进，主要改进了决定该算法计算复杂性的EMGCD的递归过程。收藏指正
5.In this paper the relationship between memory contention and (a,M), the greatest common divisor of a and M, is investigated, where M is the number of parallel memory modules, and a is a constant increment of address.
本文论述了以增量a(常数)访问M个体组成的并行存储器时,存取碰头和(a,M)的关系,这里(a,M)表示a和M的最大公因数。收藏指正
6.Therefore, the software CFD is adopted to conduct the hydraulic design and analysis of the blades, accompanied with the special analysis and evaluation of the frequency of Karman vortex street and natural frequency of the blades to confirm that there is no common divisor between them, so that an optimal design can be obtained.
因而应用CFD软件对叶片进行水力设计与分析的同时,对卡门涡频率和叶片固有频率进行专项分析、计算,在确认两者无约数关系的条件下,给出较佳的设计方案.收藏指正
尝试查询