 | Charles Edward White - 1901 - 472 σελίδες
...their sum and of their difference. Rule. — Divide the greater number by the smaller, and the last divisor by the last remainder until there is no remainder. The last divisor will be the greatest common divisor. If more than two numbers are given, find the greatest common divisor of two of them, then... | |
 | Edward Brooks - 1901 - 248 σελίδες
...the greater quantity 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 highest common divisor. NOTES. — 1. When the highest power of the leading letter is the same in both... | |
 | John Appley Ferrell - 1901 - 270 σελίδες
...number by the smaller ; then divide the divisor by the remainder ; ¿hen continue to divide the last divisor by the last remainder, until there is no remainder. The last divisor is the required G. 0. D. 8. Find the GCD of 221, 364, and 5512. Process. Explanation: (1) The G. 0.... | |
 | George Edward Atwood - 1901 - 158 σελίδες
...numbers that are not easily factored: RULE. — Divide the greater number by the less ; divide the last divisor by the last remainder, until there is no remainder. The last divisor is the greatest common divisor. 1134)1.386(1 1815)3465(1 1134 1815 252)1134(4 1650)1815(1 1008 1650... | |
 | John Appley Ferrell - 1901 - 432 σελίδες
...number by the smaller ; then divide the divisor by the remainder ; then continue to divide the last divisor by the last remainder, until there is no remainder. The last divisor is the required GCD 4. Find the GCD of 221, 364, and 5512. Process. Explanation: (1) The GCD (1) (2)... | |
 | Wilbur Fisk Nichols - 1903 - 328 σελίδες
...factors of 1 Divide the greater 4 number by the less, the divisor by the reihainder, and thus continue until there is no remainder. The last divisor will be the greatest common divisor. 92 92 3, 4, 5 all the numbers. Do the same with the quotients, till the quotients have no... | |
 | Wilbur Fisk Nichols - 1905 - 208 σελίδες
...115 92 "23 1 Divide the greater 4 number by the less, the divisor by the remainder, and thus continue until there is no remainder. The last divisor will be the greatest common divisor. the same with the quotients, till the quotients have no common factor. The product of all... | |
 | Elmer Adelbert Lyman - 1905 - 268 σελίδες
...is divided by the less, and the less is divided by the remainder, and this process is continued till there is no remainder, the last divisor will be the greatest common divisor. 82. Find in inches to two places of decimals the diagonal of a cube whose volume is 9 cu.... | |
 | William James Milne - 1907 - 616 σελίδες
...remainder, divide the less number by it, then the preceding divisor by the last remainder, and so on until there is no remainder. The last divisor will be the greatest common divisor. NOTE. — If more than two numbers are given, find the greatest common divisor of any two,... | |
 | Wilbur Fisk Nichols - 1910 - 160 σελίδες
...number by Ans. 143)1001(7 tne smaller. Divide the divisor by the remainder, 1001 and continue till there is no remainder. The last divisor will be the greatest common divisor. In the following examples find the greatest common divisor of the numerator and denominator... | |
| |
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. 
