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. Arithmetic - Page 78by A G. Blake - 1885Full view - About this book
| Daniel Adams - Arithmetic - 1810 - 190 pages
...the greatest common divisor of two numbers : 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. Note. It is evident,... | |
| Nathan Daboll - Arithmetic - 1817 - 252 pages
...lowest terms. RULE. 1. Find a common measure, by dividing the greater term by the less, and this divisor by the remainder, and so on, always dividing the last divisor by the last remainder, till nothing remains; the last divisor is the common measure.* 2. Divide both of the terms of the fraction... | |
| Nathan Daboll - Arithmetic - 1818 - 246 pages
...lowest terms. RULE. 1. Find a common measure, by dividing the greater term by the less, and this divisor by the remainder, and so on, always dividing the last divisor' by the last remainder, till nothing remains, the last divisor is the common measure.* 2. Divide both of the terms of the fraction... | |
| Nathan Daboll - Arithmetic - 1820 - 256 pages
...conimon measure, by dividing; the greater term by the less, and this divisor by the remainder, aitd so on, always dividing the last divisor by the last remainder, till nothing remains ; the last divisor is the common measure.* 2. Divide both of the terras of the fraction... | |
| Nathan Daboll - Arithmetic - 1825 - 256 pages
...lowest terms. RULE. 1. Find a common measure, by dividing the greater term by the less, and this divisor by the remainder, and so on, always dividing the last divisor by the last remainder,*Vil I nothing remains ; the last divisor is the common measure.* 2. Divide both of the terras... | |
| Nicolas Pike, Dudley Leavitt - Arithmetic - 1826 - 214 pages
...more numbers. RULE 1. If there be two pumbers only, divide the greater by the less, and this divisor by the remainder, and so on, always dividing the last divisor by the last remainder, till nothing remain ; then will the last divisor be the greatest common measure required. 2. When there... | |
| Nicolas Pike, Dudley Leavitt - Arithmetic - 1826 - 222 pages
...more numbers. RULE 1. If there be two numbers only, divide Jhe greater by the less, and this divisor by the remainder, and so on,, always dividing the last divisor by the last remainder, till nothing remain ; tben will the last divisor be the greatest common measure required. 2. When there... | |
| Daniel Adams - Arithmetic - 1828 - 266 pages
...greatest common divisor of two numbers : — Divide, the greater number by tbe 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. Note. It is evident,... | |
| Daniel Adams - Arithmetic - 1828 - 286 pages
...greatest common divisor of two numbers : — 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. Note. It is evident,... | |
| Daniel Adams - Arithmetic - 1830 - 268 pages
...greatest common divisor of two numbers : — 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. Note. It is evident,... | |
| |