辗转相减法求多个数的最大公约数的递归实现  

The Recursion Relization of the Greatest Common Divisor of Many Numbers with the Continuous Minus Method

作　　者：白海东 朱丽敏 

机构地区：[1]大庆市第五十七中学,大庆163000 [2]不详

出　　处：《鸡西大学学报（综合版）》2005年第3期39-40,共2页JOurnal of Jixi University:comprehensive Edition

摘　　要：求最大公约数是一个较为经典的问题。利用辗转相减算法,一次可以求出任意多个数的最大公约数,并编程予以实现。其效率较传统的辗转相除算法有很大程度的提高。How to calculate the greatest common divisors is a typical problem. This paper exchanges the conventional continuous division into the continuous minus and calculation the greatest common divisors for many numbers at random once, as well as puts them into a computer program. It improves the traditional continuous division method.

关 键 词：辗转相减法 辗转相除法 最大公约数 递归 

分 类 号：O141.3[理学—数学]