 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 - Σελίδα 78των A G. Blake - 1885Πλήρης προβολή - Σχετικά με αυτό το βιβλίο
 | Daniel Adams - 1810 - 190 σελίδες
...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 - 1817 - 252 σελίδες
...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 - 1818 - 246 σελίδες
...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 - 1820 - 256 σελίδες
...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 - 1825 - 256 σελίδες
...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 - 1826 - 214 σελίδες
...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 - 1826 - 222 σελίδες
...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 - 1828 - 266 σελίδες
...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 - 1828 - 286 σελίδες
...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 - 1830 - 268 σελίδες
...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,... | |
| |
