 | Nathan Daboll, David Austin Daboll - Arithmetic - 1849 - 260 pages
...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 till nothing remain ; and the last divisor will be the common divisor. EXAMPLES. t We Divide... | |
 | James Haddon - Arithmetic - 1849 - 144 pages
...measure of 12, 16, and 32. BULE. To find the greatest common measure of two numbers. Divide the greater by the less, and that divisor by the remainder, and so on till nothing remains. The last divisor is the greatest common measure. Ex. 1. Find the greatest common... | |
 | Roswell Chamberlain Smith - Arithmetic - 1850 - 314 pages
...apply to any number of successive divisions ; therefore, we have the following, — GENERAL RULE. 16. Divide the greater number by the less, and that divisor...the last divisor by the last remainder, till nothing remains ; the last divisor is the greatest common divisor required. 17. When the last divisor is 1,... | |
 | John Radford Young - Arithmetic - 1852 - 230 pages
...divisor a new dividend ; then make the second remainder a divisor, and the preceding divisor a dividend, and so on, always dividing the last divisor by the last remainder till the remainder disappears, or becomes 0. The divisor •which thus leaves no remainder is the G. c.... | |
 | J. R. Young - 1854 - 228 pages
...divisor a new dividend ; then make the second remainder a divisor, and the preceding divisor a dividend, and so on, always dividing the last divisor by the last remainder till the remainder disappears, or becomes 0. The divisor which thus leaves no remainder is the G. c. M.... | |
 | Roswell Chamberlain Smith - Arithmetic - 1856 - 334 pages
...apply to any number of successive divisions ; therefore, we have the following, — GENERAL RULE. 16. Divide the greater number by the less, and that divisor...the last divisor by the last remainder, till nothing remains ; the last divisor is the greatest common divisor required. 17. When the last divisor is 1,... | |
 | Joseph Ray - Arithmetic - 1857 - 348 pages
...3. What is the GCD of 9 and 24? Ans. 3. Eule II. — Divide the greater number by the less, and thai divisor by the remainder, and so on, always dividing...the last divisor by the last remainder, till nothing remains; the last divisor will be the greatest common divisor. NOTE. — To find the GCD of more than... | |
 | Daniel Adams - 1858 - 354 pages
...of all the prime factors common to the several numbers will be the greatest common divisor. Or, II. Divide the greater number by the less, and that divisor...divisor by the last remainder, till nothing remain. Tie last -divisor will be the greatest common divisor required. NOTK 1. — When we would find the... | |
 | Daniel Adams - Arithmetic - 1861 - 452 pages
...There is another way of finding the greatest common divisor sometimes practised ; it is as follows : I. Divide the greater number by the less, and that divisor...divisor will be the greatest common divisor required. II. When the numbers are more than two, first find the greatest common divisor of two numbers, and... | |
 | Joseph Ray - Arithmetic - 1857 - 358 pages
...Bought. 2. What is the GCD of 14 and 35? Ans. 7. 3. What is the GCD of 9 and 24? Ans. 3. Rule II.— Divide the greater number by the less, and that divisor...the last divisor by the last remainder, till nothing remains; the last divisor will be the greatest common divisor. NOTE. — To find the GCD of more than... | |
| |
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. 
