 | James Bates Thomson - 1862 - 436 σελίδες
...greatest common divisor of two numbers. Divide the greater number by the less ; then divide the preceding divisor by the last remainder, and so on, till nothing...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... | |
 | James Bates Thomson - 1862 - 428 σελίδες
...greatest common divisor of two numbers. Divide 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 lie the greatest common divisor. When there are more than two numbers given. First find the greatest... | |
 | Charles Davies - 1863 - 346 σελίδες
...divisor, Rule. Divide 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... | |
 | Olinthus Gregory - 1863 - 482 σελίδες
...the terms of the fraction : it is found thus — Divide the greater of the two numbers by the less : the last divisor by the last remainder, and so on till nothing remains : the last divisor is the greatest common measure required.* Case 2. — To reduce an improper fraction to its equivalent... | |
 | Horatio Nelson Robinson - 1863 - 432 σελίδες
...letter, and let A represent the greater and В the less. Then let us divide the greater by the less, the last divisor by the last remainder, and so on, till nothing remains. If we represent the several quotients by q, q1, q", etc.; and the remainders by R, R', R", etc., the... | |
 | Horatio Nelson Robinson - 1864 - 444 σελίδες
...letter, and let A represent the greater and B the less. Then let us divide the greater by the less, the last divisor by the last remainder, and so on, till nothing remains. If we represent the several quotients by q, q', q", etc.; and the remainders by R, K , R", etc., the... | |
 | Elias Loomis - 1864 - 386 σελίδες
...following "RULE. Divide the greater quantity by the less, and the preceding divisor by the last remainder, till nothing remains ; the last divisor will be the greatest common divisor. When the remainders decrease to unity, the given quantifies have no common divisor greater than unity,... | |
 | Charles Davies - 1866 - 356 σελίδες
...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... | |
 | James Bates Thomson - 1867 - 204 σελίδες
...divide the greater number by the leu ; then divide the preceding divisor by the last remainder, and BO on, till nothing remains. The last divisor will be the greatest common diviner. If there are more than two numbers, first find the greatest com mon divisor of any two of... | |
 | Horatio Nelson Robinson, Daniel W. Fish - 1868 - 390 σελίδες
...verticals, and write the two numbers, one on each side, the greater number one line above the less. II. Divide the greater number by the less, writing...divisor sought. IV. If more than two numbers be given, Jirst find the greatest common divisor of two of them, and then of this divisor and one of the remaining... | |
| |
Divide the less number by the remainder, the last divisor by the last remainder, and so on, till nothing remains. The last divisor will be the greatest common divisor sought. 
