最大公因子,又称最大公约数(英语:greatest common divisor,gcd),指两个或多个整数共同具有的最大约数。
...词:公钥密码体制;最大公因子;Euclid算法;时间复杂度。 [gap=1487]Keyword:Public key Cryptography; Greatest Common Divisor (GCD); Euclid Algorithm; Time Complexity ...
基于332个网页-相关网页
... higher order derivative高阶导数 highest common factor(h.c.f)最大公因子;最高公因式;最高公因子 hindu-arabic numeral阿刺伯数字 ...
基于234个网页-相关网页
26. 试写出求任何两数 m,n 的最大公因子(Greatest Common Divisor,GCD)的 recursive algorithm [85 年信息高考] 【解析】 ot...
基于3个网页-相关网页
·2,447,543篇论文数据,部分数据来源于NoteExpress
本文在一个较弱的条件下证明了关于最大公因子矩陈与因子封闭集的关系的一个猜想。
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.
最大公因子计算是计算数论的基础课题之一,它在密码算法和密码分析中有着非常广泛的应用。
Greatest Common Divisor is one of the basic subjects in computational number theory, it has a wide application in encryption and analysis of cryptography.
应用推荐