APPENDIX VIII.
ON THE REDUCTION OF FRACTIONS TO
OTHERS OF NEARLY EQUAL VALUE.
There is a useful method of finding fractions which shall be nearly equal to a given fraction, and with which the computer ought to be acquainted. Proceed as in the rule for finding the greatest common measure of the numerator and denominator, and bring all the quotients into a line. Then write down,
| 1 | 2nd Quot. | |
| 1st Quot. | 1st Quot. × 2d Quot. + 1 |
Then take the third quotient, multiply the numerator and denominator of the second by it, and add to the products the preceding numerator and denominator. Form a third fraction with the results for a numerator and denominator. Then take the fourth quotient, and proceed with the third and second fractions in the same way; and so on till the quotients are exhausted. For example, let the fraction be ⁹¹³¹/₁₃₁₂₈.
- 9131)13128(1, 2
- 1137 3997(3, 1
- 551 586(1, 15
- 201 35(1, 2
- 26 9(1, 8
- 8 1
This is the process for finding the greatest common measure of 9131 and 13128 in its most compact form, and the quotients and fractions are:
| 1 | 2 | 3 | 1 | 1 | 15 | 1 | 2 | 1 | 8 |
| 1 | 2 | 7 | 9 | 16 | 249 | 265 | 779 | 1044 | 9131 |
| 1 | 3 | 10 | 13 | 23 | 358 | 381 | 1120 | 1501 | 13128 |
It will be seen that we have thus a set of fractions ending with the original fraction itself, and formed by the above rule, as follows:
| 1st Fraction = | 1 | = | 1 | |||
| 1st Quot. | 1 | |||||
| 2d Fraction = | 2d Quot. | = | 2 | |||
| 1st Quot. × 2d Quot. + 1 | 3 | |||||
| 3d Fraction = | 2d Numʳ. × 3d Quot. + 1st Numʳ. | = | 2 × 3 + 1 | = | 7 | |
| 2d Denʳ. × 3d Quot. + 1st Denʳ. | 3 × 3 + 1 | 10 | ||||
| 4th Fraction = | 3d Numʳ. × 4th Quot. + 2d Numʳ. | = | 7 × 1 + 2 | = | 9 | ; |
| 3d Denʳ. × 4th Quot. + 2d Denʳ. | 10 × 1 + 3 | 13 |
and so on. But we have done something more than merely reascend to the original fraction by means of the quotients. The set of fractions, ¹/₁, ²/₃, ⁷/₁₀, ⁹/₁₃, &c. are continually approaching in value to the original fraction, the first being too great, the second too small, the third too great, and so on alternately, but each one being nearer to the given fraction than any of those before it. Thus, ¹/₁ is too great, and ²/₃ is too small; but ²/₃ is not so much too small as ¹/₁ is too great. And again, ⁷/₁₀, though too great, is not so much too great as ²/₃ is too small.
Moreover, the difference of any of the fractions from the original fraction is never greater than a fraction having unity for its numerator and the product of the denominator and the next denominator for its denominator. Thus, ¹/₁ does not err by so much as ¹/₃, nor ²/₃ by so much as ¹/₃₀, nor ⁷/₁₀ by so much as ¹/₁₃₀, nor ⁹/₁₃ by so much as ¹/₂₉₉, &c.
Lastly, no fraction of a less numerator and denominator can come so near to the given fraction as any one of the fractions in the list. Thus, no fraction with a less numerator than 249, and a less denominator than 358, can come so near to
| 9131 | as | 249 | . |
| 13128 | 358 |
The reader may take any example for himself, and the test of the accuracy of the process is the ultimate return to the fraction begun with. Another test is as follows: The numerator of the difference of any two consecutive approximating fractions ought to be unity. Thus, in our instance, we have ¹⁶/₂₃ and ²⁴⁹/₃₅₈, which, with a common denominator, 23 × 358, have 5728 and 5727 for their numerators.
As another example, let us examine this question: The length of the year is 365·24224 days, which is called in common life 365¼ days. Take the fraction ²⁴²²⁴/₁₀₀₀₀₀, and proceed as in the rule.
- 24224)100000(4, 7, 1, 4, 9, 2
- 2496 3104
- 64 608
- 0 32
| 1 | 7 | 8 | 39 | 359 | 757 |
| 4 | 29 | 33 | 161 | 1482 | 3125 |
and ⁷⁵⁷/₃₁₂₅ is ·24224 in its lowest terms. Hence, it appears that the excess of the year over 365 days amounts to about 1 day in 4 years, which is not wrong by so much as 1 day in 116 years; more accurately, to 7 days in 29 years, which is not wrong by so much as 1 day in 957 years; more accurately still, to 8 days in 33 years, which is not wrong by so much as 1 day in 5313 years; and so on.
This method may be applied to finding fractions nearly equal to the square roots of integers, in the following manner:
- √43 = 6 + ...
| 6 | 1 5 4 5 5 4 5 1 6 6 | 1 5 4, &c. |
| 1 | 7 6 3 9 2 9 3 6 7 1 | 7 6 3, &c. |
| 6 | 1 1 3 1 5 1 3 1 1 1 2 | 1 1 3, &c. |
Set down the number whose square root is wanted, say 43. This square root is 6 and a fraction. Set down the integer 6 in the first and third row, and 1 in the second row always. Form the successive rows each from the one before, in the following manner:
| One row being |
The next row has b′, a′, c′, formed in this order, thus, |
| a | a′ = excess of b′c′, already formed, over a. |
| b | b′ = quotient of 43 - a² divided by b. |
| c | c′ = integer in the quotient of 6 + a divided by b′. |
| Thus the second row is formed from the first, as under: | |
| 6 | 1 = excess of 7 × 1 (both just found) over 6. |
| 1 | 7 = 43 - 6 × 6 divided by 1. |
| 6 | 1 = integer of 6 + 6 divided by 7 (just found). |
| The third row is formed from the second, thus: | |
| 1 | 5 = excess of 1 × 6 over 1. |
| 7 | 6 = 43 - 1 × 1 divided by 7. |
| 1 | 1 = integer of 6 + 1 divided by 6; |
and so on. In process of time the second column, 1, 7, 1, occurs again, after which the several columns are repeated in the same order. As a final process, take the set in the lowest line (excluding the first, 6), namely, 1, 1, 3, 1, 5, 1, 3, &c. and use them by the rule given at the beginning of this article, as follows:
| 1 | 1 | 3 | 1 | 5 | 1 | 3 | 1 | 1, | &c. |
| 1 | 1 | 4 | 5 | 29 | 34 | 131 | 165 | 296 | |
| 1 | 2 | 7 | 9 | 52 | 61 | 235 | 296 | 531 |
Hence, 6¹⁶⁵/₂₉₆ is very near the square root of 43, not erring by so much as
| 1 | . |
| 296 × 531 |
If we try it, we shall find (⁶¹⁶⁵/₂₉₆) to be ¹⁹⁴¹/₂₉₆, the square of which is ³⁷⁶⁷⁴⁸¹/₈₇₆₁₆, or 43⁷/₈₇₆₁₆.
This rule is of use when it is frequently wanted to use one square root, and therefore desirable to ascertain whether any easy approximation exists by means of a common fraction. For example, √2 is often used.
| √2 | = 1 + ... |
| 1 | 1 1 |
| 1 | 1 1 |
| 1 | 2 2 2 2 2 2 |
| 1 | 2 | 5 | 12 | 29 | 70 | &c. |
| 2 | 5 | 12 | 29 | 70 | 169 |
Here it appears that
| 1 | 29 | does not err by | 1 | ; |
| 70 | 70 × 169 |
| consequently, | 99 | or | 100 - 1 | is, |
| 70 | 70 |
considering the ease of the operation, a fair approximation. In fact, ⁹⁹/₇₀ is 1·4142857 ... the truth being 1·4142135 ...
The following is an additional example:
| √ | 19 | = 4 + ... |
| 4 | 2 3 3 2 4 4 2 | |
| 1 | 3 5 2 5 3 1 3 | |
| 4 | 2 1 3 1 2 8 2 1 3 1 2, &c. |
| 1 | 1 | 4 | 5 | 14 | , &c. |
| 2 | 3 | 11 | 14 | 39 |