查询词典 highest common divisor

For instance,pooling people's ideas together are restricted by common divisor of people's opinions, that is, they are easy to reach low level but hard to be reach the high level.

现实是：汇集起来的群众意见，受制於公约数的模式，求低容易求高难，不但甚少创意，而且多流於庸俗。

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 and 2N,where N is the word length of the DDS phase accumulator.

由此产生的杂散谱可根据DDS的频率控制字和2N的最大公约数进行分类， N是DDS相位累加器的字长。

Based on a formal analysis of lifting decomposition, the hierarchical structure concept of the decomposition set, as well as the lifting decomposition technique of the polyphase matrix' greatest mth-order common divisor, is proposed to conquer the difficulties in the practical computation of and the optimal search in the huge decomposition set.

本文在形式化分析Lifting分解原理的基础上，提出了分解集合的分级结构概念以及多相矩阵的m阶最大公因子Lifling分解技术，克服了分解集合求解问题的高复杂性所带来的实际计算与搜索困难；进一步地，从数值稳定性及计算代价两方面研究了分解的评价问题，设计出两种实用的分解稳定性准则；最后，结合分级结构技术提出一种最优分解算法。

Software Description: XCCalc is a Floating-Point calculator program with the following features:- Can calculate with complex numbers like z = x + i*y - Extra precision to millions of decimal places - Uses Fast Hartley Transform to speed-up long multiplies - Separate input and output notation, base 2 to base 36 - Efficient Transcendental functions - Hyperbolic functions - Greatest Common Divisor function.

XCCalc XPCalc 是一款带有下列功能的浮点计算器软件：可以计算诸如 z = x + i*y 这样的复杂算术公式；带有数百万小数位的额外精度；使用 Fast Hartley Transform 以加速长乘法计算；基于2到36个单独的输入和输出表记法；高效的验算函数；双曲线函数；最大公约数函数。

Presents the study of second order linear constant coefficient progressive regression equation with the latest achievements in the "greatest common divisor" theory to give the great significance of Fibonacci combination series equation, Fermat Number , and Mersenne Number, and a only exceptional value each.

用"最大公约数"理论的最新结果，研究二阶线性常系数齐次递归方程，给出斐波那契数列组合式、费马数、梅森数在组合数学上的重要意义和它各自有一个且唯一例外

The algorithms of basic operations for large integer,addition,subtraction and comparison,are presented based on mixed radix representation,the algorithms of multiplication,division, modulo ,and greatest common divisor are conveyed from addition machins.

将大数采用混合基表示，对大数的加法、减法与比较运算给出相应的算法，并对加法机器上的乘法、除法、模运算以及求最大公因子的算法进行了移

Dixon method was adopted to construct a 22×22 Dixon matrix and then the greatest common divisor of two columns was extracted. After expanding the determinant of the matrix, a 64 degree univariate polynomial equation was obtained and 6 extraneous roots were canceled in the process of solving the other 3 variables.

结合矢量法和复数法建立了4个几何约束方程式，使用Dixon结式构造22×22的Dixon矩阵，对两列提取公因式后展开矩阵的行列式得到一元64次多项式方程，回代过程中去掉6组增根后得到58组解。

The character such as the unprecedented alternant sex that has as a result of network place, equal sex, if open the door legislative, the multitude that legislative ability, legislative desire has in the netizen will contribute his wisdom adequately necessarily, and this one platform is opposite Jie network all sorts of legislative program stimulate argue, achieve the greatest common divisor of an interest thereby.

由于网络所具备的前所未有的交互性、平等性等特性，假如开门立法，网民中具备立法能力、立法意愿的人群必然将充分贡献自己的聪明，并藉网络这一平台对各种立法方案激辩，从而达到一个利益的最大公约数。

Finally, the author proves the sharp bound for the indices of convergence of n*n reducible Boolean matrices with f〓≥2 the writer lets f〓 be the greatest common divisor of the distinct lengths of the elementary cycles of the associated digraph D (A for a reducible Boolean matrix A , and characterizes the matrices with the largest index.

最后，设f〓为可约布尔矩阵A的伴随有向图D的所有圈长的最大公约数，当f〓≥2时，我们得到了可约布尔矩阵幂敛指数的一个上界和达到最大幂敛指数的矩阵的完全刻划。

Firstly, four geometric loop equations are set up by using vector method in complex number fields. Secondly, three constraint equations are used to construct the Dixon resultants, which is a 6×6 matrix and contain two variables to be eliminated. Extract the greatest common divisor of two rows and two columns of Dixon matrix and compute its determinant to obtain a new equation. This equation together with the forth constraint equation can be used to construct a Sylvester resultant.

首先使用矢量法和复数法建立4个几何约束方程式；再使用Dixon结式法对3个方程式构造一个含有2个变元的6×6 Dixon矩阵，提取其中2行列元素的公因式，将新矩阵的行列式展开后得到二元高次多项式方程，该方程与剩下一个方程使用Sylvester结式消去一变元，得到一元高次方程。

You can do some assertiveness training.

你可以进行一些自信训练。

We were well on the path to making a rear-wheel-drive global platform," says Mays."

我们正致力于建立一个后轮驱动的平台，"Mays这样说道。"