| Nicolas Pike, Dudley Leavitt - 1826 - 200 páginas
...two or 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 are more... | |
| Nicolas Pike, Dudley Leavitt - 1827 - 201 páginas
...two or 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 are more... | |
| Daniel Adams - 1848 - 306 páginas
...greatest common measure of two numbers, RULE. Divide the greater number by the less, and that divrsor **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 1. — When we would find... | |
| James Ryan - 1827 - 272 páginas
...to the other, problems VII. &c. If there be a remainder, divide the less by it ; and thug proceed, **always dividing the last divisor by the last remainder, till nothing remains. The** divisor which leaves no remainder, is the common measure required. If the divisor which leaves DO remainder... | |
| Daniel Adams - 1828 - 264 páginas
...greater than 32, can do it. Hence the ride for fmding the greatest common divisor of two numbers : — **Divide the greater number by the less, and that divisor...the last divisor by the last remainder, till nothing** remain. The last divisor will be the greatest common divisor required. Note. It is evident, that, when... | |
| Daniel Adams - 1828 - 264 páginas
...rule for finding the greatest common divisor of two numbers : — Divide, the greater number by tbe **less, and that divisor by the remainder, and so on,...the last divisor by the last remainder, till nothing** remain. The last divisor will be the greatest common divisor required. Note. It is evident, that, when... | |
| Nathan Daboll - 1828 - 240 páginas
...lowest teraist Ki;r,r. — 1. Find a common measure, by dividing the greater tenp by the less, and this **divisor by the remainder, and so on, always di•viding...divisor by the last remainder, till nothing remains;** (be last divisor is the common measure.* 2. Divide both of the terms of the fraction by the common... | |
| Nathan Daboll - 1828 - 247 páginas
...a common measure, by dividing the greater term by the less, and this divisor by the remainder, ami **so on, always dividing the last divisor by the last remainder, till nothing** remams, the last divisor is the common measure.* 2. Divide both of the terms of the fraction by the... | |
| Nathan Daboll - 1829 - 240 páginas
...common measure, by dividing the greater term by the Ions, and this divisor by the remainder, and pn **on, always dividing the last divisor by the last remainder, till nothing** remaini', the last divisor is the common measure.* 2. Divide both of the terms of the fraction by the... | |
| Daniel Adams - 1830 - 264 páginas
...greater than 32, can do it. Hence the rule for finding the greatest common divisor of two numbers : — **Divide the greater number by the less, and that divisor...the last divisor by the last remainder, till nothing** remain. The last divisor will be the greatest common divisor required. Note. It is evident, that, when... | |
| |