论文部分内容阅读
从课本上我们已经学会了用短除法来求两个数的最大公约数,即先用这两个数公有的质因数连续去除,一直除到所得到的商是互质数为止,然后把所有的除数连乘起来。但是,当两个数公有的质因数比较难找(即质因数比较大)的时候,如果采用短除法就不容易求解。今天,我给大家介绍两种求最大公约数的方法,这两种方法求解非常简单,只要在两个数之间来回作减法或除法运算就行,而且在求解比较大的两个数的最大公约数时,也绝对不会发生困难。
From the textbook we have learned to use the short division method to find the greatest common divisor of two numbers, that is, the prime number of the two numbers is used to remove continuously until the quotient of the quotient obtained is a prime number, and then all Divisor even multiply. However, when the prime numbers of two numbers are more difficult to find (ie, the quality factor is relatively large), it is not easy to solve with the short division method. Today, I introduce you to two methods of finding the greatest common divisor, which are easy to solve, as long as subtracting or dividing back and forth between two numbers, and the largest convention for solving the larger two numbers Number of times, it will not happen.