查询词典 highest common divisor

The inputs to it are divisor and dividend, the outputs from it are quotient and remainder.

一种完成除法运算的部件，它的输入是除数和被除数，输出是商和余数。

We show a matrix A is similar to an orthogonal matrix over a field of characteristic 2 if and only if ( 1 ) the invariant factors of A are symmetic,(2) A has at least an elementary divisor of the form ( x + 1 ) m.

本文利用矩阵方程证明如下两个结果：设F为一个域char=2，在F上矩阵A相似于一个正交矩阵的充要条件为(1)A的不变因子是对称的。(2)A至少有一个形为(X十1)的初等因子。

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里至少有一个是孤立数，因此可以证明孤立数在完全平方数里有正密度，另外也给出求解确定孤立数的方法。

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-子群。

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算法，比普通的标量乘法的速度有大的提高。

In this article, we make some research due to some problems of HECC, including the math background of hyperelliptic curves cryptography, the algorithm of divisor scalar multiplication, and providing a kind of general digital signature based on hyperelliptic curves cryptography.

为了确保这一系统的稳定性与安全性，HECC的几个主要参数的选取问题就起了很大的作用，本文对这几个参数选取作了详细介绍，并且归纳了求基点和求阶的方法。

In order to refine a method for defence against at least one attack made by means of differential power analysis on at least one hyperelliptic cryptosystem, in particular at least one hyperelliptic public key cryptosystem, which is given by at least one hyperelliptic curve of any genus over a finite field in a first group, where the hyperelliptic curve is given by at least one co-efficient, so that an essential contribution can be made towards an efficient and secure implementation of the hyperelliptic cryptosystem, it is proposed that the hyperelliptic curve and/or at least one element of the first group, in particular at least one in particular reduced divisor and/or at least one intermediate result of a scalar multiplication, is randomised.

为了改进用于防御在至少一个超椭圆密码系统中、特别是在至少一个超椭圆公共密钥密码系统中通过微分功率分析作出的至少一个攻击的方法，该超椭圆公共密钥密码系统是通过在第一组中有限域中任何种类的至少一个超椭圆曲线给出的，其中超椭圆曲线由至少一个系数给出，以使得可以对于超椭圆密码系统的有效而安全的实施方案作出重要的贡献，提出将超椭圆曲线和/或第一组的至少一个元素、特别是至少一个特定的减小的除数和/或标量乘法的至少一个中间结果进行随机化。

A very efficient probability message coding scheme of hyperelliptic curve cryptosystems based on GF (p≠2) and a new divisor compression scheme of hyperelliptic curve over GF are presented.

提出了非特征2的有限域上超椭圆曲线密码体制的一个消息编码方案和除子压缩方案。

QIQD uses piecewise quadratic curves to calculate the multiplicator of contending window after a frame collision and the divisor of contending window after a successful transmission, respectively, which is capable of reducing collision probability and improving channel utilization.

QIQD通过分段二次曲线计算数据帧碰撞冲突后增大竞争窗口的倍乘因子和数据帧成功传输后减小竞争窗口的倍除因子，从而能够降低碰撞概率和提高信道利用率。

You can do some assertiveness training.

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

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

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