greatest common divisor

常見(jiàn)例句

Use Euclid’s algorithm to compute the greatest common divisor of 7735 and 4185.
適用歐幾里德算法來(lái)計(jì)算7735和4185的最大公約數(shù)。
If there are several flights that depart from one airport then the greatest common divisor of their flight numbers should be equal to 1.
如果有幾條航線和同一個(gè)機(jī)場(chǎng)相關(guān)聯(lián)，那么這些航線編號(hào)的最大公約數(shù)必須等于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.
最大公因子計(jì)算是計(jì)算數(shù)論的基礎(chǔ)課題之一，它在密碼算法和密碼分析中有著非常廣泛的應(yīng)用。