Euclidean algorithm

名词 n.
中文释义

英文释义

名词 n.
  1. Any of certain algorithms first described in Euclid's Elements. historical
    — The Euclidean algorithms for finding a compound ratio also allowed a ratio and an inverse ratio, and more than two ratios to be compounded, since each compounded pair is equivalent to a single ratio between lines.
  2. Specifically, a method, based on a division algorithm, for finding the greatest common divisor (gcd) of two given integers; any of certain variations or generalisations of said method.
    — 1985, Erich Kaltofen, Heinrich Rolletschek, Arithmetic in Quadratic Fields with Unique Factorization, Bob F. Caviness (editor), EUROCAL '85, European Conference on Computer Algebra, Linz, Proceedings, Volume 2, Springer, LNCS 204, page 279, In a quadratic field Q (√), D a squarefree integer, with class number 1 any algebraic integer can be decomposed uniquely into primes but for only 21 domains Euclidean algorithms are known. We prove that for D<-19 even remainder sequences with possibly nondecreasing norms cannot determine the GCD of arbitrary inputs.

词形变化

Euclidean algorithms plural Euclid's algorithm alternative
0 次浏览 数据来源: Wiktionary