In particular book seven is a self-contained introduction to number theory and contains the Euclidean algorithm for finding the greatest common divisor of two numbers.
特别是七本书是一个自给自足的介绍一些理论和包含Euclidean算法 找到最大公约数的两个数字。
The method here is essentially the use of the Euclidean algorithm to find the highest common factor of a and b but is also related to continued fractions.
这里的方法基本上是使用Euclidean算法找到最高的共同因素, A和B ,但也关系到持续分数。
The following year he wrote on number theory, making a contribution to the theory of the Euclidean algorithm.
第二年,他写的一些理论, 作出贡献的理论Euclidean算法 。
He also did important work on differential geometry and, in another contribution to number theory, he showed that the number of divisions in the Euclidean algorithm never exceeds five times the number of digits in the smaller number.
他还重要工作, 微分 几何,并在另一贡献, 数论 ,他发现,一些部门在Euclidean算法 从来没有超过5倍位数的人数较少。
The proof is very typical of Motzkin in that the Euclidean algorithm is given a new formulation, which at first seems to be leading away from the problem at hand, but is suddenly seen to be the decisive key to its solution.
证明是非常典型的Motzkin的,因为Euclidean算法给出了一个新的提法,这首似乎是领导远离手头上的问题,但突然被视为决定性的关键,其解决办法。
Bracmat uses the Euclidean algorithm to simplify fractions.
The greatest common divisor polynomial g(x) of two polynomials a(x) and b(x) is defined as the product of their shared irreducible polynomials, which can be identified using the Euclidean algorithm.
两个多项式a(x)和b(x)的最大公约数g(x)定义为它们分解之后共有的不可約因式的乘积,这可以用辗转相除法进行计算。
In view of slow realization of RSA algorithm operation, a series of methods including doubling of small prime and Euclidean algorithm extension and binary algorithm are adopted during the generation of private key cryptosystem. which the realization of algorithm can accelerated
针对 RSA实现算法运算速度慢的特点 ,在生成密钥对的过程中采用小素数翻番、欧几里得扩展算法、二元法等一系列方法 ,以加快算法实现速度.
In the 19th century, the Euclidean algorithm led to the development of new number systems, such as Gaussian integers and Eisenstein integers.
19世纪,辗转相除法促成了新数系的建立,如高斯整数和艾森斯坦整数。
The Euclidean algorithm also has other applications in error-correcting codes; for example, it can be used as an alternative to the Berlekamp-Massey algorithm for decoding BCH and Reed-Solomon codes, which are based on Galois fields.
欧几里得算法也被应用于纠错码,例如,它可以代替Berlekamp-Massey算法解基于有限域的BCH码和里德-所罗门码。
While at Bristol he worked on the Euclidean algorithm (norm function) in a general setting having already proved while at Cambridge that there are only finitely many real quadratic fields with a Euclidean algorithm.
虽然在布里斯托尔,他的欧几里德算法( 规范功能)在一般设置已经证明,而在剑桥,只有有限的许多实二次域与Euclidean算法。
One of the first papers which he published after arriving in the United States was on the Euclidean algorithm in principal ideal domains.