greatest common divisor

常见例句

Use Euclid’s algorithm to compute the greatest common divisor of 7735 and 4185.
适用欧几里德算法来计算7735和4185的最大公约数。
If there are several flights that depart from one airport then the greatest common divisor of their flight numbers should be equal to 1.
如果有几条航线和同一个机场相关联，那么这些航线编号的最大公约数必须等于1。
blog.sina.com.cn
Greatest Common Divisor is one of the basic subjects in computational number theory, it has a wide application in encryption and analysis of cryptography.
最大公因子计算是计算数论的基础课题之一，它在密码算法和密码分析中有着非常广泛的应用。