Find The Greatest Common Divisor of Two - 项目摘要 |
摘要
| 管理 |
论坛
文档
| 软件包 |
|
|
|
| 项目描述: |
This function computes the GCD (Greatest Common Divisor) of any two integers, negative or positive, up to 28 digits long. The method used is based on an ancient algorithm devised by Euclid. Euclid was a Greek geometer of the 3d century b.c., famous for his treatise on geometry. Many of his logical concepts are still being studied and applied in mathematics today. This function is one of those concepts in action.
这个函数计算了任何两个整数，负数或者正数的GCD（最大公约数），最大可达到28位数。使用的这个方法是基于由Euclid发明的古老的算法。Euclid是一位三世纪的希腊几何学家，以他的几何学论述而出名。他的很多逻辑概念在今天的数学中仍然被学习和采用。这个函数是那些仍然采用的数学概念中的一个。
来源: http://www.freevbcode.com/ShowCode.Asp?ID=1778 |
| 类别: |
| |
|
发布者：
cbd001
|
|
| 最新发布源码包 |
| 软件包 |
版本号 |
日期 |
本地下载 |
| GCD |
1.0 |
2003-12-05 |
下载 |
|
|
