| 1839
...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 nothing** remain ; and the last divisor will be the common divisor. EXAMPLES. 1. What is the greatest common... | |
| Bewick Bridge - 1839 - 224 páginas
...the greatest common measure of two numbers : " Divide the greater by the lesser, and the preceding **divisor by the last remainder, till nothing remains ; the last divisor is the greatest common** measure." To find the greatest common measure of three numbers, a, b c; let d be the greatest common... | |
| George Leonard (Jr.) - 1839 - 347 páginas
...fraction, Divide the greater number by the smaller, and then the divisor by the remainder, if there be any, **and so on, always dividing the last divisor by the last remainder** until nothing is left, when the last divisor will be the greatest common divisor. Note .— The denominator... | |
| Daniel Adams - 1840 - 264 páginas
...greaterthan their Jifference, Hence the rule for finding the greatest common divisor Oj two numbers : — **Divide the greater number by the less, and that divisor...the last divisor by the last remainder, till nothing** remain. The last divisor will be the greatest common divisor required. Note. It is evident, that, when... | |
| Richard W. Green - 1840 - 288 páginas
...Divide the greater number by the less, and then divide the divisor by the remainder; and thus continue **dividing the last divisor by the last remainder, till nothing remains. The last divisor** will be the greatest common divisor. To find the common divisor of more than two numbers, find first... | |
| Daniel Adams - 1848 - 306 páginas
...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 divisor...remainder, and so on, always dividing the last divisor** t,y the last remainder, till nothing remain. The last divisor will be the greatest common divisor required.... | |
| Nathan Daboll - 1841 - 228 páginas
...common measure, by dividing the greater terra by the less, and this divisor by the remainder, and BO **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 by the common meslure, and the quotients... | |
| George Leonard - 1841 - 340 páginas
...fraction, Divide the larger number by Hie smaller, and then the divisor by the remainder, if there be any, **and so on, always dividing the last divisor by the last remainder** until nothing is left, when the last divisor will be the greatest common divisor. ffote. The denominator... | |
| George Leonard - 1841
...fraction, Divide the larger number by the smaller, and then the. divisor by the remainder, if there be any, **and. so on, always dividing the last divisor by the last remainder** until nothing is left, when tlie last divisor wilt be the greatest common divisor. Note. The denominator... | |
| Roswell Chamberlain Smith - 1842 - 306 páginas
...for 84 being 12 more than Proof 12)72 = 6 "l^"1 must contain 12 exactly once more 12)84=7 tnan 7213. **The number 12 then is a common divisor of 72 and 84,...common divisor of 495 and 585. 495)585(1 Proof. 495** 45)49 5 = 11 90)49 5(5 45)58 5=13 450 19. The last divisor is 45, and Gr. com. divi. 45)90(2 it leaves... | |
| |