 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.  Ferrell's Elementary Arithmetic - Seite 150von John Appley Ferrell - 1901 - 232 SeitenVollansicht - Über dieses Buch
 | James Bryce - 1837 - 322 Seiten
...55. III. 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 be greater... | |
 | George Roberts Perkins - 1841 - 274 Seiten
...greater by the less, then divide the divisor 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. Examples. 1. What ia the greatest common measure of 360, and 630... | |
 | George Roberts Perkins - 1846 - 266 Seiten
...deduce this RULE. Divide the 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... | |
 | George Roberts Perkins - 1849 - 346 Seiten
...deduce this RULE. 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. — When there are more than two numbers whose greatest... | |
 | George Roberts Perkins - 1849 - 356 Seiten
...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... | |
 | George Roberts Perkins - 1850 - 364 Seiten
...deduce this RULE. 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. — When there are more than two numbers whose greatest... | |
 | George Roberts Perkins - 1850 - 356 Seiten
...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... | |
 | George Roberts Perkins - 1851 - 356 Seiten
...deduce this RULE. 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.—When there are more than two numbers whose greatest... | |
 | George Roberts Perkins - 1855 - 388 Seiten
...deduce this RULE. 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 divizor will be the greatest common divisor. NOTE. — When there are more than two numbers whose greatest... | |
 | Edward Olney - 1876 - 324 Seiten
...the GCD of two numbers, divide the greater by the less, and this divisor by the remainder, continuing to divide the last divisor by the last remainder until there is no remainder. The last divisor is the GC Z>. sought. DEM. — In order to demonstrate 42 ) 138 ( 3 this rule, let us find the GCD of j^,... | |
| |
