最大公因子计算是计算数论的基础课题之一，它在密码算法和密码分析中有着非常广泛的应用。
Greatest Common Divisor is one of the basic subjects in computational number theory, it has a wide application in encryption and analysis of cryptography.
本文在一个较弱的条件下证明了关于最大公因子矩陈与因子封闭集的关系的一个猜想。
This paper gives a proof of a conjecture on the relation between the greatest common divisor matrix and the factor closed set under a certain condition.
最大公约数，也称最大公因数、最大公因子，指两个或多个整数共有约数中最大的一个。
The greatest common divisor, also known as the greatest common factor, the most common factor, refers to two or more integers have one of the biggest in a few.
应用推荐