converting a repeating decimal to a fraction
The following algorithm![]()
can be used to convert a repeating decimal to a fraction:
-
1.
Set the repeating decimal equal to .
-
2.
Multiply both sides of the equation by , where is the number of digits that appear under the bar.
-
3.
If applicable, rewrite the second equation so that its repeating part up with the repeating part in the original equation.
-
4.
Subtract the original equation from the most recently obtained equation. (The repeating part should cancel at this step.)
-
5.
If applicable, multiply both sides by a large enough power of so that the equation is of the form , where and are integers.
-
6.
Divide both sides of the equation by the coefficient of .
-
7.
Reduce the fraction to lowest terms.
Below, this algorithm is demonstrated for with the steps indicated on the far .
| (1) |
| (2) |
| (3) |
| (4) |
| (5) |
| (6) |
| (7) |
An important application of this algorithm is that it supplies a proof for the fact that :
| Title | converting a repeating decimal to a fraction |
|---|---|
| Canonical name | ConvertingARepeatingDecimalToAFraction |
| Date of creation | 2013-03-22 16:55:22 |
| Last modified on | 2013-03-22 16:55:22 |
| Owner | Wkbj79 (1863) |
| Last modified by | Wkbj79 (1863) |
| Numerical id | 10 |
| Author | Wkbj79 (1863) |
| Entry type | Algorithm |
| Classification | msc 11A99 |
| Classification | msc 11-00 |