| 求多个数的最大公约数的算法设计 |
| |
| 引用本文： | 汤剑红. 求多个数的最大公约数的算法设计[J]. 计算机时代, 2012, 0(6): 21-22,24 |
| |
| 作者姓名： | 汤剑红 |
| |
| 作者单位： | 浙江师范大学数理与信息工程学院,浙江金华,321004 |
| |
| 摘 要： | 在求两个数的最大公约数算法的基础上,研究了求多个数的最大公约数的算法,并利用C语言实现了枚举法、辗转相除法和更相减损术三种算法的程序设计。
|
| 关 键 词： | 最大公约数 枚举法 辗转相除法 更相减损术 |
Algorithm to calculate the greatest common divisor of multiple numbers |
| |
| Tang Jianhong. Algorithm to calculate the greatest common divisor of multiple numbers[J]. Computer Era, 2012, 0(6): 21-22,24 |
| |
| Authors: | Tang Jianhong |
| |
| Affiliation: | Tang Jianhong (College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang 321004, China) |
| |
| Abstract: | Based on the algorithm to calculate the greatest common divisor of two numbers, the algorithm to calculate the greatest common divisor of multiple numbers is studied in this paper. C language is used to realize the design of enumeration method, Euclid＇s algorithm and loss-reducing technique. |
| |
| Keywords: | greatest common divisor enumeration method Euclid＇ s algorithm loss-reducing technique |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
