Hence the rule .for finding 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. Rudimentary arithmetic - Page 66by James Haddon - 1849 - 128 pagesFull view - About this book
| Henry Raper - 1870 - 968 pages
...common measure, that is, the largest number which will divide them both without a remainder. To find ths greatest common measure of two numbers, Divide the greater by the less. Consider the remainder as a new divisor to the former divisor as a dividend, and find the next remainder.... | |
| James Haddon - Algebra - 1871 - 244 pages
...greatest common measure of a and h. Hence the rule maybe thus expressed : " Divide the greater number by the less, and that divisor by the remainder, and so on till nothing remains ; the last divisor will be the greatest common measure." This rule would apply to the examples in Art. X. LEAST COMMON... | |
| Thomas J. Livesey - 1877 - 112 pages
...that is to say, 6 is the greatest common measure of 54 and 282. Now enunciate the Rule : — To find greatest common measure of two numbers, divide the greater by the less ; if there be a remainder divide it into the former divisor ; if there still be a remainder, divide... | |
| Montagu H. Foster - 1881 - 182 pages
...: thus of 12, 18, 30, the common measures are 2, 3, 6, and the greatest common measure is 6. Tofind the greatest common measure of two numbers. Divide the greater by the less, and the divisor by the remainder, and so on until nothing remains. The last divisor is the greatest common... | |
| Henry Raper - Nautical astronomy - 1882 - 952 pages
...greatest common mtature, that is, the largest number which will divide them both without a remainder. To find the greatest common measure of two numbers, Divide the greater by the less. Consider the remainder as a new divisor to the former divisor as a dividend, and find the next remainder.... | |
| William Dodds - 1884 - 162 pages
...14аУ ; -6x-y3¿3 and ix-y*. (5) 3(a-|-6)and4(aJ-62); 8(a+6)2 and 10 (a + 6)3. 47. To find the GCM of two numbers, divide the greater by the less, and that divisor by the remainder; proceed in like manner until there is no remainder ; the last divisor is the GCM To find the GCM of... | |
| Joseph Ray - Arithmetic - 1857 - 340 pages
...of 14 and 35? Ans. 1. 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 the last divisor by the last remainder, till nothing remains; the last divisor will... | |
| |