查询词典 divisor function

Next produced several kind of matrices similar determinations principle, the matrix equally in value from this has similarly drawn out the elementary divisor with the characteristic matrix, invariant factor two related concepts.

其次给出了几种矩阵相似的判定法则，矩阵相似与特征矩阵等价由此引出了初等因子，不变因子两个相关概念。

In 2000, F. LUCA proved that Fermat number are anti-sociable numbers, and in 2005, M. H. LE proved all powers of 2 are anti-sociable numbers. We have used the method of M. H. LE to obtain some new results of the anti-sociable numbers. For every integer n containing prime divisors that are 1 mod 4, let p mod 4 be an arbitrary prime divisor of n. There is at least one anti-sociable number in n^2, p^2n^2, p^4n^2, and p^6n^2. Therefore we can prove that anti-sociable numbers have positive density in perfect square numbers. We also give a method to find the exact anti-sociable numbers.

LUCA证明了Fermat数都是孤立数；2005年，乐茂华教授证明了2的方幂都是孤立数，用乐茂华教授的方法给出孤立数的一些新的结果：对于任意含有4w+1型素因子的正整数n，设p为n的任意一个4w+1型素因子，则在n^2，p^2n^2，p^4n^2，p^6n^2里至少有一个是孤立数，因此可以证明孤立数在完全平方数里有正密度，另外也给出求解确定孤立数的方法。

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.

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

In § 1, we give main definitions and basic results that are needed in the paper. In § 2, we determine the structures of somegroups by using s-normality of Sylow subgroups and the maximal subgroups of Sylow subgroups. There are the main theorems that 1 Let G be a finite group and P be a Sylow p-subgroup of G where p is a prime divisor of |G|.

我们在§1中将给出本文所需的主要概念和基本结果，在§2中讨论Sylow子群、Sylow子群的极大子群的s-正规性对群的结构的影响，主要结果是1设G为有限群，p为|G|的素因子，P为G的Sylow p-子群。

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

This method can be applied to the ECC.(2)The author stresses investigation about the scalar multiplication of divisor, which is the core algorithm in the hyperelliptic curve cryptosystem.

提出了一个关于除子的SWNAF(Sliding Windows Non_Adjacent_Form)标量乘法算法，它是基于滑动窗口的NAF算法，比普通的标量乘法的速度有大的提高。

There had been a moment during the breakfast meeting, though, after the backslapping and the small talk and when all of us were seated, with Vice President Cheney eating his eggs Benedict impassively and Karl Rove at the far end of the table discreetly checking his BlackBerry, that I witnessed a different side of the man.

那次早餐会期间，在表示过关心和寒暄以后，我们所有人坐了下来，我注意观察了一下，副总统切尼面无表情地吃着班尼迪克蛋（Eggs benedict，源自美国，以英式松饼、火腿、水煮蛋以及荷兰酱组合而成），卡尔。罗夫在餐桌的远端谨慎地经常查看他的黑莓手机，我目睹了他所不为人知的一面。

Talk Undelete failed; someone else may have undeleted the page first.

Talk 无法删除选定的页面或图像（它可能已经被其他人删除了）。