greatest common divisor
短语最大公约数 [计] 最大公约数
发音
UK
/ˈɡɹeɪ.tɪst ˈkɒm.ən dɪˈvaɪ.zə/
US
/ˈɡɹeɪ.tɪst ˈkɑ.mɪn dɪˈvaɪ.zɚ/
词形变化
greatest common divisors
复数
greatest common divisors
别名
gcd
greatest common factor
highest common factor
释义与例句
n.
-
1.
The largest positive integer (respectively polynomial, element of a given ring) that is a divisor of each of a given set of integers (respectively polynomials, elements of a given ring).
最大公因子
最大公约数
数学The greatest common divisor of 66, 30 and 18 is 6.
1974, John M. Peterson, Basic Concepts of Elementary Mathematics, Prindle, Weber & Schmidt, page 148, Euclid's algorithm is a process for finding the greatest common divisor of any two whole numbers.