查询词典 common divisor

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结式消去一变元，得到一元高次方程。

In this paper, we introduce the concepts of the great common P-divisor, least common P-multiple of two distinct nonzero elements x, y in arbitrary unique factorization domain R, and denote them byp, and p respectively.

在本文中，作为通常的整数环Z上的最大公因子和最小公倍数的推广，我们在惟一分解整环R上定义了最大公P-因子和最小公P-倍元，分别记为_P和_P。

And Pharaoh spoke to Joseph, saying, Your father and your brothers have come to you.

47：5 法老对约瑟说，你父亲和你弟兄们到你这里来了。

Additionally, the approximate flattening of surface strip using lines linking midpoints on perpendicular lines between geodesic curves and the unconditional extreme value method are discussed.

提出了用测地线方程、曲面上两点间短程线来计算膜结构曲面测地线的方法，同时，采用测地线间垂线的中点连线和用无约束极值法进行空间条状曲面近似展开的分析。