 | George Roberts Perkins - Arithmetic - 1849 - 356 pages
...greater by the less, then divide the divism by the remainder, and thus continue to divide the preceding divisor by the last remainder, until there is no remainder. The last divisor will be the greatest common measure. NOT£ — Where there is no common measure, the last divisor will be 1. EXAMPLES. 1. What... | |
 | George Roberts Perkins - Arithmetic - 1849 - 344 pages
...greater by the less, then divide the diviso? by the remainder, and thus continue to divide the preceding divisor by the last remainder, until there is no remainder. The last divisor will be the greatest commoji measure. NOTE. — Where there is no common measure, the last divisor will be 1. EXAMPLES.... | |
 | George Roberts Perkins - Arithmetic - 1850 - 356 pages
...greater by the less, then divide the divisoi by the remainder, and thus continue to divide the preceding divisor by the last remainder, until there is no remainder. The last divisor will be the greatest common measure. NOTE. — Where there is no common measure, the last divisor will be 1. EXAMPLES. 1 . What... | |
 | James Elliot - 1850 - 116 pages
...next operation, and by it divide the preceding divisor now used as a dividend. Continue this process until there is no remainder. The last divisor will be the greatest common measure. EXAMPLE 1. Find the greatest common measure of the two quantities x3 + 2л2 + 2x + 1 and я?... | |
 | George Roberts Perkins - Arithmetic - 1851 - 356 pages
...276)360(1 276 84)276(3 252 24)84(3 72 12)24(2 24 Hence, to find the greatest common divisor of two numbers, we deduce this RULE. Divide the greater number by...last divisor will be the greatest common divisor. » NOTE.—When there are more than two numbers whose greatest common divisor is required, we must... | |
 | George Roberts Perkins - Arithmetic - 1855 - 388 pages
...276)360(1 276 84)276(3 252 24)84(3 72 12)24(2 24 Hence, to find the greatest common divisor of two numbers, we deduce this RULE. Divide the greater number by...last remainder, until there is no remainder. The last divizor will be the greatest common divisor. NOTE. — When there are more than two numbers whose greatest... | |
 | James B. Dodd - Arithmetic - 1859 - 368 pages
...Take the divisor and remainders for a new set of numbers, with which proceed as before ; and so on, until there is no remainder. The last divisor will be the greatest common measure of the given numbers. Thus, to find the greatest common measure of 390, 930, and 4350. 390)930(2... | |
 | Robert Fowler - 1861 - 426 pages
...out the division again as far as possible, continue the former process with the remainder and divisor until there is no remainder. The last divisor will be the greatest common measure required. If A and Б represent the two quantities whose о. с. м. is required, the dimensions... | |
 | Benjamin Greenleaf - 1863 - 338 pages
...preceding divisor the dividend and the remainder the divisor, until a divisor is obtained which leaves no remainder; the last divisor will be the greatest common divisor. NOTE 1. When the two quantities are expressions of the same degree, it is immaterial which is made the divisor.... | |
 | Stoddard A. Felter - Arithmetic - 1864 - 412 pages
...the less, and, if there be a remainder, divide the preceding divisor by it, and so continue dividing, until there is no remainder. The last divisor will be the greatest common divisor sought. If there are more than two numbers, find the greatest common divisor of the first two, then... | |
| |
Divide the greater number by the less, then the less number 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. 
