 | Joseph Ray - Arithmetic - 1880 - 420 pages
...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 remains; the last divisor will be the greatest common divisor sought. NOTE. — A condensed form of operation CONDENSED OPERATION. may be used after the... | |
 | Joseph Ray - Arithmetic - 1880 - 420 pages
...greater number by the less, and the divisor by the remainder, and so on; always dividing tiie last divisor by the last remainder, till nothing remains; the last divisor will be tiie greatest common divisor sougld. NOTE. — A condensed form of operation CONDENSED OPERATION. may... | |
 | Daniel W. Fish - Arithmetic - 1883 - 348 pages
...number by the less, and the less number by the remainder, if any, and so continue to divide the last divisor by the last remainder, till nothing remains. The last divisor will be the GCD 2. If more than two numbers are given, find the в. с. D. of two of them, then of this divisor... | |
 | Joseph Hughes - Education - 1883 - 568 pages
...by it ; if there be still a remainder, the second divisor by it, and so on, always dividing the last preceding divisor by the last remainder till nothing remains. The last divisor is the GCM (/>) 625 is \ of 5000. .'. divide by 8 and multip'y the quolient by 500x3 l6l6 + 8 = 2O2.... | |
 | Popular educator - 1884 - 904 pages
...divide these quantities withont a remainder. Thus 6d is the greatest common measure of 12d and 18iZ ; and 8 is the greatest common measure of 16, 24, and 32. 111. To find the greatest common measnre of two given quantifiée. Rule. — Divid« the greater of... | |
 | Gordon Augustus Southworth - Arithmetic - 1895 - 334 pages
...common prime factors. This will be the gcd required. Or, — II. Divide the greater number by the less and the preceding divisor by the last remainder till nothing remains. The last divisor is the gcd If there are more than two numbers, find the gcd of any two of them, and then of this gcd... | |
 | Gordon Augustus Southworth - Arithmetic - 1903 - 152 pages
...common prime factors. This will be the (rCD required. Or, — II. Divide the greater number by the less and the preceding divisor by the last remainder till nothing remains. The last divisor is the GCD If there are more than two numbers, find the GCD of any two of them, and then of this GCD... | |
 | Gordon Augustus Southworth - 1906 - 332 pages
...prime factors. This will be the g. с. d. required. Or, — II. Divide the greater number by the less and the preceding divisor by the last remainder till nothing remains. The last divisor is the g. с. d. If there are more than two numbers, find the gcd of any two of them, and then of this... | |
 | Gordon Augustus Southworth, John Charles Stone - Arithmetic - 1910 - 188 pages
...common prime factors. This will be the GGD required. Or, — II. Divide the greater number by the less and the preceding divisor by the last remainder till nothing remains. The last divisor is the GOD If there are more than two numbers, find the GCD of any two of them, and then of this Q-.GD... | |
 | John Charles Stone, James Franklin Millis - Arithmetic - 1911 - 272 pages
...common prime factors. Tliis will be the GCD required. Or,— II. Divide the greater number by the less and the preceding divisor by the last remainder till nothing remains. The last divisor is the GCD If there are more than two numbers, find the GCD oj any two of them, and then of this GCD... | |
| |
II. Divide the greater number by the less and the preceding divisor by the last remainder till nothing remains. The last divisor is the... 
