 | George G. Carey - 1818 - 602 σελίδες
...or more numbers, is the smallest number that each of them will divide wit limit a remainder. CASE I. To find the greatest common measure of two numbers. RULE. Divide the greater number by the less, and this divisor by the remainder. Proceed in this manner, always dividing the last divisor by the last... | |
 | Daniel Adams - 1848 - 322 σελίδες
...Questions. — ^61. "What is a common divisor of two or more numbers ? Repeat the rule for finding it. To find the 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... | |
 | Zadock Thompson - 1832 - 182 σελίδες
...will not divide by another greater than iUelf. Therefore, 233. To find the greatest common divisor of two numbers, RULE. — Divide the greater number by the less, and the divisor by the remainder, and so on, always dividing the last divisor by the last remainder, till nothing... | |
 | Richard Mosley - 1836 - 164 σελίδες
...Q the greatest common measure of — is 4. 2 is also a common measure, bat it is not the greatest. 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 till nothing remains. The last divisor is... | |
 | Zadock Thompson - 1838 - 174 σελίδες
...will not divide by another greater tban iuelf. Therefore, 233. To find the greatest common divisor of two numbers. . . RULE. — Divide the greater number by the less, and the divisor by the remainder, and so on, always dividing the last divisor by the last remainder, till nothing... | |
 | Nathan Daboll - 1839 - 220 σελίδες
...denominator, it is called their common denominator. PROBLEM I. To find the greatest common divisor of two numbers RULE. Divide the greater number by the less, and this divisor by the remainder, and so on, always dividing the last divisor by the last remainder till... | |
 | Nathan Daboll - 1843 - 254 σελίδες
...denominator, it is called their common denominator. PROBLEM I. To fold the greatest common divisor of two numbers RULE. Divide the greater number by the less, and this divisor by the remainder, and so on, always dividing the last divisor by the last remainder till... | |
 | Daniel Adams - 1848 - 354 σελίδες
...— If 01. What is a common divisor of two or mure munbeis ? Kepeat the rule for finding it. Tojind the greatest common measure of two numbers, RULE. Divide the greater number by the less, and that divisor by the remainder, and so on, always dividing the last divisor by the lust remainder, till... | |
 | Nathan Daboll, David Austin Daboll - 1849 - 260 σελίδες
...denominator, it is called their common denominator. PROBLEM I. To find the greatest common divisor of two numbers RULE. Divide the greater number by the less; and this divisor "by the remainder, and so on, always dividing the last divi•sor by the last r.vn?.inder... | |
 | Barnard Smith - 1854 - 368 σελίδες
...= 3 x 25 ; therefore 3 measures this multiple of 15 ; and similarly any other multiple of 15. . 51. To find the greatest common measure of two numbers. RULE. Divide the greater number by the less; if there be a remainder divide the first divisor by it ; if there be still a remainder, divide the... | |
| |
REFERENCE. 2. — FACTORING. Greatest Common Divisor. I. (1) From the given numbers reject all multiples of any of the given numbers. (2) Separate each of the remaining numbers into its prime factors. 
