 | 1867 - 964 σελίδες
...KULE. — Divide tho greater by the loss, then the preceding divisor by the remainder, and so on, nntil there is no remainder. The last divisor will be the greatest common measure required. EXAMPLE. — To find tho greatest common measure of 532 and 1274. Arrange the process thus... | |
 | David Steel - 1805 - 392 σελίδες
...common measure, divide the greater number by the lesser, and the last divisor by the remainder till there is no remainder; the last divisor will be the greatest common measure. EXAMPLE I. Reduce the fraction 4f£f *° 'ts lowest terms. 9767-7-4418=2, remainder 931. 4418-7-931=4,... | |
 | James Bryce - 1837 - 322 σελίδες
...The greatest common measure of two numbers is found by dividing the greater by the less, and the last divisor by the last remainder, until there is no remainder : the last divisor is the measure required. Let a and /, be the quantities whose common measure is required, and let a... | |
 | William Foster - 1840 - 92 σελίδες
...letter : divide the greater by the less, and the preceding divisor by the last remainder, and so on till there is no remainder, the last divisor will be the greatest common measure. Ex. Find the greatest common measure of 2« + 1 + -r' and 2*4 ¿"+2*+ 1. We arrange the quantities... | |
 | George Roberts Perkins - 1841 - 274 σελίδες
...measure of two numbers by the following RULE, Divide the greater by the less, then divide the divisor by the remainder, and thus continue to divide the...last divisor will be the greatest common measure. Examples. 1. What ia the greatest common measure of 360, and 630 ? OPBRATION. 360)630(1 360 270)360(1... | |
 | Davis Wasgatt Clark - 1844 - 394 σελίδες
...remainder, divide the first divisor by this remainder. 3. Continue to divide in the same manner till there is no remainder ; the last divisor will be the greatest common measure. Note 1. — If, in the course of the reduction, one factor is found to be common to all the terms of one... | |
 | George Roberts Perkins - 1846 - 266 σελίδες
...greater number by the less, then the less numbtr by the remainder ; thus continue to divide the last divisor by the last remainder, until there is no remainder. The last divisor will be the greatest common divisor. NOTE. — When there are more than two numbers whoae greatest common divisor is required,... | |
 | Davis Wasgatt Clark - 1846 - 374 σελίδες
...remainder, divide the first divisor by this remainder. 3. Continue to divide in the same manner till there is no remainder ; the last divisor will be the greatest common measure. Note 1.—If, in the course of the reduction, one factor is found to be common to all the terms of one of... | |
 | Frederic A. Adams - 1846 - 230 σελίδες
...less, and then take the divisor for a new dividend, and divide it by the remainder, and so on, till there is no remainder ; the last divisor will be the greatest common divisor. . i Apply the above rule to the sixth example. 187)221(1 187 ~34"U87C5 greatest common divisor... | |
 | George Roberts Perkins - 1847 - 432 σελίδες
...equivalent to the following RULE. Divide ¿he denominator by the numerator ; then divide this divisor by the remainder, and thus continue to divide the...preceding divisor by the last remainder, until there is no • tmainder, or until we have obtained as many terms as we wish; then will these successive quotients... | |
| |
Divide the greater number by the less, the divisor by the remainder, and thus continue to divide the last divisor by the last remainder until there is no remainder ; the last divisor will be the greatest common divisor. 
