| Charles Austin Hobbs - Arithmetic - 1889 - 343 pages
...been proved that 23 is a common divisor; hence it is the GCD The method may be stated as follows : **Divide the greater number by the less, and the divisor by the remainder, and so on** till there is no remainder, each time dividing the last divisor by the last remainder. The last divisor... | |
| Emerson Elbridge White - Arithmetic - 1883 - 362 pages
...which are common. The product of the common factors will be the greatest common divisor. Bule. — **Divide the greater number by the less, and the divisor by the remainder, and** the second divisor by the second remainder, and so on, until there is no remainder. The last divisor... | |
| Henry B. Maglathlin - 1894 - 360 pages
...compact form than the first. 124. Hence, to find the greatest common divisor of two numbers, we may **Divide the greater number by the less, and the divisor by the remainder, and so on,** until there is no remainder; the last divisor will be the greatest common divisor. 9. Find the greatest... | |
| Joseph Ray - Arithmetic - 1903 - 320 pages
...it is, therefore, their 6)12(2 GCD (Prin.). 1£ Rule. — 1. Divide the greater number by the less, **the divisor by the remainder, and so on, always dividing the last divisor by the last remainder,** until nothing remains. 2. The last divisor will be the greatest common divisor. NOTE. — To find the... | |
| Joseph Ray - Arithmetic - 1857 - 320 pages
...3. What is the GCD of 9 and 24? Ans. 3. Rule II. — Divide the greater number by the less, and that **divisor by the remainder, and so on, always dividing...divisor by the last remainder, till nothing remains;** the last divisor will be the greatest common divisor. NOTE. — To find the GCD of more than two numbers,... | |
| |