英语词汇“gcd”的英英意思、用法、释义、翻译、读音、例句、短语、词组-英语词典

gcd n. (also GCD) [originally after French p. g. c. d. < the initial letters of plus grand commun diviseur (both 1828 in the source translated in quot. 1831)] Mathematics greatest common divisor, the largest whole number that divides two or more given numbers without remainder; (in later use also) a divisor of two or more elements of a commutative ring whose own divisors include all the other common divisors of those elements.

ΚΠ

1831 E. C. Ross tr. L. P. M. Bourdon Elements Algebra vi. 279 We begin with finding the g. c. d. [Fr. le p. g. c. d.] of the two polynomials of the lowest degree.

1910 Encycl. Brit. II. 531/2 If we resolve two numbers into their prime factors, we can find their Greatest Common Divisor or Highest Common Factor (written G.C.D. or G.C.F. or H.C.F.), i.e. the greatest number which is a factor of both.

2008 J.-L. Chabert in T. Gowers Princeton Compan. Math. ii. 109/1 There is a clear difference between this algorithm for approximating π and Euclid's algorithm for calculating the gcd of two positive integers.

单词	gcd
释义	> as lemmas gcd gcd n. (also GCD) [originally after French p. g. c. d. < the initial letters of plus grand commun diviseur (both 1828 in the source translated in quot. 1831)] Mathematics greatest common divisor, the largest whole number that divides two or more given numbers without remainder; (in later use also) a divisor of two or more elements of a commutative ring whose own divisors include all the other common divisors of those elements. ΚΠ 1831 E. C. Ross tr. L. P. M. Bourdon Elements Algebra vi. 279 We begin with finding the g. c. d. [Fr. le p. g. c. d.] of the two polynomials of the lowest degree. 1910 Encycl. Brit. II. 531/2 If we resolve two numbers into their prime factors, we can find their Greatest Common Divisor or Highest Common Factor (written G.C.D. or G.C.F. or H.C.F.), i.e. the greatest number which is a factor of both. 2008 J.-L. Chabert in T. Gowers Princeton Compan. Math. ii. 109/1 There is a clear difference between this algorithm for approximating π and Euclid's algorithm for calculating the gcd of two positive integers. extracted from Gn. < as lemmas
随便看	gnide gnidge gnidge off gnip gnit gnocchi gnocchis gnodde gnoff gnome gnome-like gnome-owl gnomed gnomelike gnomeowl gnomes gnomic gnomic aorist gnomic poet gnomical gnomically gnomiccer gnomiccest gnomicer gnomicest

> as lemmas