 | George Roberts Perkins - 1849 - 346 σελίδες
...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. — When there are more than two numbers whose greatest common divisor is required,... | |
 | George Roberts Perkins - 1850 - 356 σελίδες
...common measure of two numbers by the following Divide the greater by the less, then divide the divisoi by the remainder, and thus continue to divide the...common measure of 360 and 630? Operation. 360)630(1 360 270)360(1 270 ~90)270(3 270 ~~0 Hence, the greatest common measure is 90. 2. What is the greatest common... | |
 | George Roberts Perkins - 1850 - 364 σελίδες
...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. — When there are more than two numbers whose greatest common divisor is required,... | |
 | James Elliot - 1850 - 116 σελίδες
...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 я? + 2x+l.... | |
 | George Roberts Perkins - 1851 - 356 σελίδες
...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.—When there are more than two numbers whose greatest common divisor is required,... | |
 | George Roberts Perkins - 1855 - 388 σελίδες
...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 divizor will be the greatest common divisor. NOTE. — When there are more than two numbers whose greatest... | |
 | James B. Dodd - 1859 - 368 σελίδες
...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 σελίδες
...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 of... | |
 | Stoddard A. Felter - 1864 - 412 σελίδες
...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,... | |
 | Francis Walkingame - 1865 - 222 σελίδες
...divido the less by the remainder; continue the process, always dividing the preceding divisor by the remainder until there is no remainder. The last divisor will be the greatest common measure. EXAMPLE. — Find the greatest common measure of 3252 and 42-18. 3252)4248(1 3252 "996)3252(3 2988... | |
| |
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. 
