| Roswell Chamberlain Smith - Arithmetic - 1856 - 311 pages
...therefore, we have the following, — GENERAL RULE. 16. 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 is the greatest common divisor required. 17. When the last divisor is 1, the given... | |
| Joseph Ray - Arithmetic - 1857 - 336 pages
...3. What is the GCD of 9 and 24? Ans. 3. Eule II. — Divide the greater number by the less, and thai **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,... | |
| Benjamin Greenleaf - Arithmetic - 1857 - 444 pages
...the partial fractions after the second, &c. EULE. — Divide the greater term of the given fraction **by the less, and the divisor by the remainder, and so on,** as in finding the greatest common divisor. The quotients thus found will be the denominators of the... | |
| Benjamin Greenleaf - Arithmetic - 1858 - 444 pages
...the partial fractions after the second, &c. RULE. — Divide the greater tern of ike given fraction **by the less, and the divisor by the remainder, and so on,** as in finding the greatest common divisor. The quotients thus found will be the denominators of the... | |
| Francis WALKINGAME - 1859
...When the sums of the alternate digits of any number are equal, the number can be divided by 11. RULE. **Divide the greater number by the less, and the divisor by the remainder** till nothing remains. The divisor which produces no remainder is the greatest common measure required.... | |
| Daniel Adams - Arithmetic - 1861 - 280 pages
...divisor sometimes practised ; it is as follows : I. Divide the greater number by the less, and that **divisor by the remainder, and so on, always dividing...the last divisor by the last remainder, till nothing** remain. The last divisor will be the greatest common divisor required. II. When the numbers are more... | |
| Ireland commissioners of nat. educ - 1865
...number be wished for that may bring the fraction to its lowest terms at once, divide the greater term **by the less, and the divisor by the remainder; and so on,** dividing each divisor by the last remainder till nothing remains. The last divisor is the number by... | |
| W. M. LUPTON - 1867
...their lowest terms. To find the greatest common measure of two numbers. RULE. — Divide the greater **by the less and the divisor by the remainder, and so on** continually till there is no remainder. The last divisor will be the G. С. М. The reason of this... | |
| Joseph Ray - Arithmetic - 1857 - 336 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,... | |
| Henry Bartlett Maglathlin - Arithmetic - 1869 - 324 pages
...compact form than the first. 124t 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... | |
| |