 | Daniel Leach, William Draper Swan - 1861 - 344 σελίδες
...When the numbers are large, — RULE. Divide the greater number by the less, and continue to divide the last divisor by the last remainder, till nothing...remains. The last divisor will be the greatest common measure. 70. This rule depends upon the principle illustrated in (AnT. 52,) viz., that any number that... | |
 | Daniel Adams - 1861 - 452 σελίδες
...divisor sometimes practised ; it is as follows : I. Divide the greater number by the less, and that divisor by the remainder, and so on, always dividing...the last divisor by the last remainder, till nothing remain. The last divisor will be the greatest common divisor required. II. When the numbers are more... | |
 | Benjamin Greenleaf - 1861 - 338 σελίδες
...two or more numbers ? remainder divide the preceding divisor by it. and so continue dividing until nothing remains. The last divisor will be the greatest common divisor. NOTE. — When the greatest common divisor is required of more than two numbers, find it of two of them,... | |
 | James Bates Thomson - 1862 - 436 σελίδες
...the greater number by the less ; then divide the preceding divisor by the last remainder, and so on, till nothing remains. The last divisor will be the greatest common divisor. When there are more than too numbers given. First find the greatest common divisor of any two of tliem... | |
 | Charles Davies - 1863 - 346 σελίδες
...the greater number by the less, and then divide the preceding divisor by the remainder, and so on, till nothing remains: the last divisor will be the greatest common divisor. Examples. 1. What is the greatest common divisor of 216 and 408? 2. Find the greatest common divisor... | |
 | Elias Loomis - 1864 - 386 σελίδες
...be obtained. Hence the following "RULE. Divide the greater quantity by the less, and the preceding divisor by the last remainder, till nothing remains...last divisor will be the greatest common divisor. When the remainders decrease to unity, the given quantifies have no common divisor greater than unity,... | |
 | Emerson Elbridge White, Henry Beadman Bryant - 1865 - 344 σελίδες
...remainder; the first remainder by the second remainder; the second remainder by the third, and so on until nothing remains. The last divisor will be the greatest common divisor. Note. — The greatest common divisor is chiefly used in reducing fractions to their lowest terms. See Art.... | |
 | Charles Davies - 1866 - 356 σελίδες
...less, and then divide the divisor by the remainder, and continue to divide the last divisor by the remainder, till nothing remains: the last divisor will be the greatest common divisor. Examples. 1. What is the greatest common divisor of 216 and 408? 2. Find the greatest common divisor... | |
 | Joseph Ray - 1857 - 358 σελίδες
...3. What is the GCD of 9 and 24? Ans. 3. Rule II.— Divide the greater number by the less, and that divisor by the remainder, and so on, always dividing...find the GCD of more than two numbers, first find the GCD of two of them, then of that com. divisor and one of the remaining numbers, and so on for all... | |
 | Whitman Peck - 1868 - 304 σελίδες
...The common method of finding the gcd, has been to divide the greater of two numbers by the less, and the last divisor by the last remainder, till nothing remains. The last divisor is the gcd Proceed in the same manner with the divisor thus found and another number. Ex. 2. — What... | |
| |
Divide the greater number by the less, and that divisor by the remainder, and so on, always dividing the last divisor by the last remainder, till nothing remain. 
