Repeating decimal · Lablypedia

It can be shown that a number is rational if and only if its decimal representation is repeating or terminating. For example, the decimal representation of ⁠1/3⁠ becomes periodic just after the decimal point, repeating the single digit "3" forever, i.e. 0.333.... A more complicated example is ⁠3227/555⁠, whose decimal becomes periodic at the second digit following the decimal point and then repeats the sequence "144" forever, i.e. 5.8144144144.... Another example of this is ⁠593/53⁠, which becomes periodic after the decimal point, repeating the 13-digit pattern "1886792452830" forever, i.e. 11.18867924528301886792452830....

The finite digit sequence that is repeated infinitely is called the repetend or reptend. If the repetend is a zero, this decimal representation is called a terminating decimal rather than a repeating decimal, since the zeros can be omitted and the decimal terminates before these zeros. Every terminating decimal representation can be written as a decimal fraction, a fraction whose denominator is a power of 10 (e.g. 1.585 = ⁠1585/1000⁠); it may also be written as a ratio of the form ⁠k/2ⁿ·5^m⁠ (e.g. 1.585 = ⁠317/2³·5²⁠). However, every number with a terminating decimal representation also trivially has a second, alternative representation as a repeating decimal whose repetend is the digit "9". This is obtained by decreasing the final (rightmost) non-zero digit by one and appending a repetend of 9. Two examples of this are 1.000... = 0.999... and 1.585000... = 1.584999.... (This type of repeating decimal can be obtained by long division if one uses a modified form of the usual division algorithm.)

Any number that cannot be expressed as a ratio of two integers is said to be irrational. Their decimal representation neither terminates nor infinitely repeats, but extends forever without repetition (see § Every rational number is either a terminating or repeating decimal). Examples of such irrational numbers are √2 and π.

Background

Notation

Any textual representation is necessarily finite, which is why special non-decimal notation is required to represent repeating decimals. Below are several notational conventions. None of them are accepted universally.

Vinculum: In the United States, Canada, India, France, Germany, Denmark, the Netherlands, Italy, Switzerland, the Czech Republic, Slovakia, Slovenia, Chile, Taiwan, and Turkey, the convention is to draw a horizontal line (a vinculum) above the repetend.
Dots: In some Islamic countries, such as Bangladesh, Malaysia, Morocco, Pakistan, Tunisia, Iran, Algeria and Egypt, as well as the United Kingdom, New Zealand, Australia, South Africa, Japan, Thailand, India, South Korea, Singapore, and the People's Republic of China, the convention is to place dots above the outermost numerals of the repetend.
Parentheses: In parts of Europe, incl. Austria, Finland, Norway, Poland, Russia and Ukraine, as well as Vietnam and Israel, the convention is to enclose the repetend in parentheses. This can cause confusion with the notation for standard uncertainty or multiplication.
Arc: In Spain and some Latin American countries, such as Argentina, Brazil, and Mexico, the arc notation over the repetend is also used as an alternative to the vinculum and the dots notation.
Ellipsis: Informally, repeating decimals are often represented by an ellipsis (three periods, 0.333...), especially when the previous notational conventions are first taught in school. This notation introduces uncertainty as to which digits should be repeated and even whether repetition is occurring at all, since such ellipses are also employed for irrational numbers; π, for example, can be represented as 3.14159....
"r" notation: In online settings or informal writing, where notating any of the above may be impossible, a simple way of writing repeated numbers is to place an r at the start of the repetition. For example, 1.234 can be written 1.2r34. In cases where the repetition starts at the decimal, the decimal point can be omitted, so 11.1886792452830 would be 11r1886792452830.

In English, there are various ways to read repeating decimals aloud. For example, 1.234 may be read "one point two repeating three four", "one point two repeated three four", "one point two recurring three four", "one point two repetend three four" or "one point two into infinity three four".

Decimal expansion and recurrence sequence

In order to convert a rational number represented as a fraction into decimal form, one may use long division. For example, consider the rational number ⁠5/74⁠:

<u id="mwATc"> 0.0<span style="text-decoration:overline;" about="#mwt114" typeof="mw:Transclusion" data-mw='{"parts":[{"template":{"target":{"wt":"overline","href":"./Template:Overline"},"params":{"1":{"wt":"675"}},"i":0}}]}' id="mwATg">675</span></u> 74 ) 5.00000 <u id="mwATk">4.44</u> 560 <u id="mwATo">518</u> 420 <u id="mwATs">370</u> 500

etc. Observe that at each step we have a remainder; the successive remainders displayed above are 56, 42, 50. When we arrive at 50 as the remainder, and bring down the "0", we find ourselves dividing 500 by 74, which is the same problem we began with. Therefore, the decimal repeats: 0.0675675675....

For any integer fraction ⁠A/B⁠, the remainder at step k, for any positive integer k, is A × 10^k (modulo B).

Every rational number is either a terminating or repeating decimal

For any given divisor, only finitely many different remainders can occur. In the example above, the 74 possible remainders are 0, 1, 2, ..., 73. If at any point in the division the remainder is 0, the expansion terminates at that point. Then the length of the repetend, also called "period", is defined to be 0.

If 0 never occurs as a remainder, then the division process continues forever, and eventually, a remainder must occur that has occurred before. The next step in the division will yield the same new digit in the quotient, and the same new remainder, as the previous time the remainder was the same. Therefore, the following division will repeat the same results. The repeating sequence of digits is called "repetend" which has a certain length greater than 0, also called "period".

In base 10, a fraction has a repeating decimal if and only if in lowest terms, its denominator has at least a prime factor different from 2 and 5 (a prime denominator is considered as a prime factor of itself), or in other words, the denominator cannot be expressed as 2^m5ⁿ, where m and n are non-negative integers.

Every repeating or terminating decimal is a rational number

Each repeating decimal number satisfies a linear equation with integer coefficients, and its unique solution is a rational number. In the example above, α = 5.8144144144... satisfies the equation

The process of how to find these integer coefficients is described below.

Formal proof

Given a repeating decimal $x = a . b \bar{c}$ where $a$ , $b$ , and $c$ are groups of digits, let $n = ⌈ \log_{10} b ⌉$ , the number of digits of $b$ . Multiplying by $10^{n}$ separates the repeating and terminating groups:

$10^{n} x = a b . \bar{c} .$

If the decimals terminate ( $c = 0$ ), the proof is complete. For $c \neq 0$ with $k \in N$ digits, let $x = y . \bar{c}$ where $y \in Z$ is a terminating group of digits. Then,

$c = d_{1} d_{2} . . . d_{k}$

where $d_{i}$ denotes the i-th digit, and

$x = y + \sum_{n = 1}^{\infty} \frac{c}{{(10^{k})}^{n}} = y + (c \sum_{n = 0}^{\infty} \frac{1}{{(10^{k})}^{n}}) - c .$

Since $\sum_{n = 0}^{\infty} \frac{1}{{(10^{k})}^{n}} = \frac{1}{1 - 10^{- k}}$ ,

$x = y - c + \frac{10^{k} c}{10^{k} - 1} .$

Since $x$ is the sum of an integer ( $y - c$ ) and a rational number ( $\frac{10^{k} c}{10^{k} - 1}$ ), $x$ is also rational.

8 more chapters are free with a Lably account.

Fractions with prime denominators

A fraction in lowest terms with a prime denominator other than 2 or 5 (i.e. coprime to 10) always produces a repeating decimal. The length of the repetend (period of the repeating decimal segment) of ⁠1/p⁠ is equal to the order of 10 modulo p. If 10 is a primitive root modulo p, then the repetend length is equal to p − 1; if not, then the repetend length is a factor of p − 1. This result can be deduced from Fermat's little theorem, which states that 10^p−1 ≡ 1 (mod p).

The base-10 digital root of the repetend of the reciprocal of any prime number greater than 5 is 9.

If the repetend length of ⁠1/p⁠ for prime p is equal to p − 1 then the repetend, expressed as an integer, is called a cyclic number.

Cyclic numbers

Examples of fractions belonging to this group are:

⁠1/7⁠ = 0.142857, 6 repeating digits
⁠1/17⁠ = 0.0588235294117647, 16 repeating digits
⁠1/19⁠ = 0.052631578947368421, 18 repeating digits
⁠1/23⁠ = 0.0434782608695652173913, 22 repeating digits
⁠1/29⁠ = 0.0344827586206896551724137931, 28 repeating digits
⁠1/47⁠ = 0.0212765957446808510638297872340425531914893617, 46 repeating digits
⁠1/59⁠ = 0.0169491525423728813559322033898305084745762711864406779661, 58 repeating digits
⁠1/61⁠ = 0.016393442622950819672131147540983606557377049180327868852459, 60 repeating digits
⁠1/97⁠ = 0.010309278350515463917525773195876288659793814432989690721649484536082474226804123711340206185567, 96 repeating digits

The list can go on to include the fractions ⁠1/109⁠, ⁠1/113⁠, ⁠1/131⁠, ⁠1/149⁠, ⁠1/167⁠, ⁠1/179⁠, ⁠1/181⁠, ⁠1/193⁠, ⁠1/223⁠, ⁠1/229⁠, etc. (sequence A001913 in the OEIS).

Every proper multiple of a cyclic number (that is, a multiple having the same number of digits) is a rotation:

⁠1/7⁠ = 1 × 0.142857 = 0.142857
⁠2/7⁠ = 2 × 0.142857 = 0.285714
⁠3/7⁠ = 3 × 0.142857 = 0.428571
⁠4/7⁠ = 4 × 0.142857 = 0.571428
⁠5/7⁠ = 5 × 0.142857 = 0.714285
⁠6/7⁠ = 6 × 0.142857 = 0.857142

The reason for the cyclic behavior is apparent from an arithmetic exercise of long division of ⁠1/7⁠: the sequential remainders are the cyclic sequence {1, 3, 2, 6, 4, 5}. See also the article 142,857 for more properties of this cyclic number.

A fraction which is cyclic thus has a recurring decimal of even length that divides into two sequences in nines' complement form. For example ⁠1/7⁠ starts '142' and is followed by '857' while ⁠6/7⁠ (by rotation) starts '857' followed by its nines' complement '142'.

The rotation of the repetend of a cyclic number always happens in such a way that each successive repetend is a bigger number than the previous one. In the succession above, for instance, we see that 0.142857... < 0.285714... < 0.428571... < 0.571428... < 0.714285... < 0.857142.... This, for cyclic fractions with long repetends, allows us to easily predict what the result of multiplying the fraction by any natural number n will be, as long as the repetend is known.

A proper prime is a prime p which ends in the digit 1 in base 10 and whose reciprocal in base 10 has a repetend with length p − 1. In such primes, each digit 0, 1,..., 9 appears in the repeating sequence the same number of times as does each other digit (namely, ⁠p − 1/10⁠ times). They are:

61, 131, 181, 461, 491, 541, 571, 701, 811, 821, 941, 971, 1021, 1051, 1091, 1171, 1181, 1291, 1301, 1349, 1381, 1531, 1571, 1621, 1741, 1811, 1829, 1861,... (sequence A073761 in the OEIS).

A prime is a proper prime if and only if it is a full reptend prime and congruent to 1 mod 10.

If a prime p is both full reptend prime and safe prime, then ⁠1/p⁠ will produce a stream of p − 1 pseudo-random digits. Those primes are

7, 23, 47, 59, 167, 179, 263, 383, 503, 863, 887, 983, 1019, 1367, 1487, 1619, 1823, 2063... (sequence A000353 in the OEIS).

Other reciprocals of primes

Some reciprocals of primes that do not generate cyclic numbers are:

⁠1/3⁠ = 0.3, which has a period (repetend length) of 1.
⁠1/11⁠ = 0.09, which has a period of two.
⁠1/13⁠ = 0.076923, which has a period of six.
⁠1/31⁠ = 0.032258064516129, which has a period of 15.
⁠1/37⁠ = 0.027, which has a period of three.
⁠1/41⁠ = 0.02439, which has a period of five.
⁠1/43⁠ = 0.023255813953488372093, which has a period of 21.
⁠1/53⁠ = 0.0188679245283, which has a period of 13.
⁠1/67⁠ = 0.014925373134328358208955223880597, which has a period of 33.
⁠1/71⁠ = 0.01408450704225352112676058338028169, which has a period of 35.
⁠1/73⁠ = 0.01369863, which has a period of eight.
⁠1/79⁠ = 0.0126582278481, which has a period of 13.
⁠1/83⁠ = 0.01204819277108433734939759036144578313253, which has a period of 41.
⁠1/89⁠ = 0.01123595505617977528089887640449438202247191, which has a period of 44.
⁠1/101⁠ = 0.0099, which has a period of 4.
⁠1/103⁠ = 0.0097087378640776699029126213592233, which has a period of 34.

(sequence A006559 in the OEIS)

The reason is that 3 is a divisor of 9, 11 is a divisor of 99, 41 is a divisor of 99999, etc. To find the period of ⁠1/p⁠, we can check whether the prime p divides some number 999...999 in which the number of digits divides p − 1. Since the period is never greater than p − 1, we can obtain this by calculating ⁠10^p−1 − 1/p⁠. For example, for 11 we get

\frac{10^{11 - 1} - 1}{11} = 909090909

and then by inspection find the repetend 09 and period of 2.

Those reciprocals of primes can be associated with several sequences of repeating decimals. For example, the multiples of ⁠1/13⁠ can be divided into two sets, with different repetends. The first set is:

⁠1/13⁠ = 0.076923
⁠10/13⁠ = 0.769230
⁠9/13⁠ = 0.692307
⁠12/13⁠ = 0.923076
⁠3/13⁠ = 0.230769
⁠4/13⁠ = 0.307692

where the repetend of each fraction is a cyclic re-arrangement of 076923. The second set is:

⁠2/13⁠ = 0.153846
⁠7/13⁠ = 0.538461
⁠5/13⁠ = 0.384615
⁠11/13⁠ = 0.846153
⁠6/13⁠ = 0.461538
⁠8/13⁠ = 0.615384

where the repetend of each fraction is a cyclic re-arrangement of 153846.

In general, the set of proper multiples of reciprocals of a prime p consists of n subsets, each with repetend length k, where nk = p − 1.

Totient rule

For an arbitrary integer n, the length L(n) of the decimal repetend of ⁠1/n⁠ divides φ(n), where φ is the totient function. The length is equal to φ(n) if and only if 10 is a primitive root modulo n.

In particular, it follows that L(p) = p − 1 if and only if p is a prime and 10 is a primitive root modulo p. Then, the decimal expansions of ⁠n/p⁠ for n = 1, 2, ..., p − 1, all have period p − 1 and differ only by a cyclic permutation. Such numbers p are called full repetend primes.

Reciprocals of composite integers coprime to 10

If p is a prime other than 2 or 5, the decimal representation of the fraction ⁠1/p²⁠ repeats:

⁠1/49⁠ = 0.020408163265306122448979591836734693877551.

The period (repetend length) L(49) must be a factor of λ(49) = 42, where λ(n) is known as the Carmichael function. This follows from Carmichael's theorem which states that if n is a positive integer then λ(n) is the smallest integer m such that

a^{m} \equiv 1 (\mod n)

for every integer a that is coprime to n.

The period of ⁠1/p²⁠ is usually pT_p, where T_p is the period of ⁠1/p⁠. There are three known primes for which this is not true, and for those the period of ⁠1/p²⁠ is the same as the period of ⁠1/p⁠ because p² divides 10^p−1−1. These three primes are 3, 487, and 56598313 (sequence A045616 in the OEIS).

Similarly, the period of ⁠1/p^k⁠ is usually p^k–1T_p.

If p and q are primes other than 2 or 5, the decimal representation of the fraction ⁠1/pq⁠ repeats. An example is ⁠1/119⁠:

119 = 7 × 17

λ(7 × 17) = LCM(λ(7), λ(17)) = LCM(6, 16) = 48,

where LCM denotes the least common multiple.

The period T of ⁠1/pq⁠ is a factor of λ(pq) and it happens to be 48 in this case:

⁠1/119⁠ = 0.008403361344537815126050420168067226890756302521.

The period T of ⁠1/pq⁠ is LCM(T_p, T_q), where T_p is the period of ⁠1/p⁠ and T_q is the period of ⁠1/q⁠.

If p, q, r, etc. are primes other than 2 or 5, and k, ℓ, m, etc. are positive integers, then

\frac{1}{p^{k} q^{ℓ} r^{m} \dots}

is a repeating decimal with a period of

LCM (T_{p^{k}}, T_{q^{ℓ}}, T_{r^{m}}, \dots)

where T_p^k, T_q^ℓ, T_r^m,... are respectively the period of the repeating decimals ⁠1/p^k⁠, ⁠1/q^ℓ⁠, ⁠1/r^m⁠,... as defined above.

Reciprocals of integers not coprime to 10

An integer that is not coprime to 10 but has a prime factor other than 2 or 5 has a reciprocal that is eventually periodic, but with a non-repeating sequence of digits that precede the repeating part. The reciprocal can be expressed as:

\frac{1}{2^{a} \cdot 5^{b} p^{k} q^{ℓ} \dots},

where a and b are not both zero.

This fraction can also be expressed as:

\frac{5^{a - b}}{10^{a} p^{k} q^{ℓ} \dots},

if a > b, or as

\frac{2^{b - a}}{10^{b} p^{k} q^{ℓ} \dots},

if b > a, or as

\frac{1}{10^{a} p^{k} q^{ℓ} \dots},

if a = b.

The decimal has:

An initial transient of max(a, b) digits after the decimal point. Some or all of the digits in the transient can be zeros.
A subsequent repetend which is the same as that for the fraction ⁠1/p^k q^ℓ ⋯⁠.

For example ⁠1/28⁠ = 0.03571428:

a = 2, b = 0, and the other factors p^k q^ℓ ⋯ = 7
there are 2 initial non-repeating digits, 03; and
there are 6 repeating digits, 571428, the same amount as ⁠1/7⁠ has.

Converting repeating decimals to fractions

Given a repeating decimal, it is possible to calculate the fraction that produces it. For example:

Another example:

A shortcut

The procedure below can be applied in particular if the repetend has n digits, all of which are 0 except the final one which is 1. For instance for n = 7:

\begin{matrix} x & = 0.000000100000010000001 \dots \\ 10^{7} x & = 1.000000100000010000001 \dots \\ (10^{7} - 1) x = 9999999 x & = 1 \\ x & = \frac{1}{10^{7} - 1} = \frac{1}{9999999} \end{matrix}

So this particular repeating decimal corresponds to the fraction ⁠1/10ⁿ − 1⁠, where the denominator is the number written as n 9s. Knowing just that, a general repeating decimal can be expressed as a fraction without having to solve an equation. For example, one could reason:

\begin{matrix} 7.48181818 \dots & = 7.3 + 0.18181818 \dots \\ = \frac{73}{10} + \frac{18}{99} = \frac{73}{10} + \frac{9 \cdot 2}{9 \cdot 11} = \frac{73}{10} + \frac{2}{11} \\ = \frac{11 \cdot 73 + 10 \cdot 2}{10 \cdot 11} = \frac{823}{110} \end{matrix}

\begin{matrix} 11.18867924528301886792452830 \dots & = 11 + 0.18867924528301886792452830 \dots \\ = 11 + \frac{10}{53} = \frac{11 \cdot 53 + 10}{53} = \frac{593}{53} \end{matrix}

It is possible to get a general formula expressing a repeating decimal with an n-digit period (repetend length), beginning right after the decimal point, as a fraction:

\begin{matrix} x & = 0. \bar{a_{1} a_{2} \dots a_{n}} \\ 10^{n} x & = a_{1} a_{2} \dots a_{n} . \bar{a_{1} a_{2} \dots a_{n}} \\ (10^{n} - 1) x = 99 \dots 99 x & = a_{1} a_{2} \dots a_{n} \\ x & = \frac{a_{1} a_{2} \dots a_{n}}{10^{n} - 1} = \frac{a_{1} a_{2} \dots a_{n}}{99 \dots 99} \end{matrix}

More explicitly, one gets the following cases:

If the repeating decimal is between 0 and 1, and the repeating block is n digits long, first occurring right after the decimal point, then the fraction (not necessarily reduced) will be the integer number represented by the n-digit block divided by the one represented by n 9s. For example,

0.444444... = ⁠4/9⁠ since the repeating block is 4 (a 1-digit block),
0.565656... = ⁠56/99⁠ since the repeating block is 56 (a 2-digit block),
0.012012... = ⁠12/999⁠ since the repeating block is 012 (a 3-digit block); this further reduces to ⁠4/333⁠.
0.999999... = ⁠9/9⁠ = 1, since the repeating block is 9 (also a 1-digit block)

If the repeating decimal is as above, except that there are k (extra) digits 0 between the decimal point and the repeating n-digit block, then one can simply add k digits 0 after the n digits 9 of the denominator (and, as before, the fraction may subsequently be simplified). For example,

0.000444... = ⁠4/9000⁠ since the repeating block is 4 and this block is preceded by 3 zeros,
0.005656... = ⁠56/9900⁠ since the repeating block is 56 and it is preceded by 2 zeros,
0.00012012... = ⁠12/99900⁠ = ⁠1/8325⁠ since the repeating block is 012 and it is preceded by 2 zeros.

Any repeating decimal not of the form described above can be written as a sum of a terminating decimal and a repeating decimal of one of the two above types (actually the first type suffices, but that could require the terminating decimal to be negative). For example,

1.23444... = 1.23 + 0.00444... = ⁠123/100⁠ + ⁠4/900⁠ = ⁠1107/900⁠ + ⁠4/900⁠ = ⁠1111/900⁠
- or alternatively 1.23444... = 0.79 + 0.44444... = ⁠79/100⁠ + ⁠4/9⁠ = ⁠711/900⁠ + ⁠400/900⁠ = ⁠1111/900⁠
0.3789789... = 0.3 + 0.0789789... = ⁠3/10⁠ + ⁠789/9990⁠ = ⁠2997/9990⁠ + ⁠789/9990⁠ = ⁠3786/9990⁠ = ⁠631/1665⁠
- or alternatively 0.3789789... = −0.6 + 0.9789789... = −⁠6/10⁠ + 978/999 = −⁠5994/9990⁠ + ⁠9780/9990⁠ = ⁠3786/9990⁠ = ⁠631/1665⁠

An even faster method is to ignore the decimal point completely and go like this

1.23444... = ⁠1234 − 123/900⁠ = ⁠1111/900⁠ (denominator has one 9 and two 0s because one digit repeats and there are two non-repeating digits after the decimal point)
0.3789789... = ⁠3789 − 3/9990⁠ = ⁠3786/9990⁠ (denominator has three 9s and one 0 because three digits repeat and there is one non-repeating digit after the decimal point)

It follows that any repeating decimal with period n, and k digits after the decimal point that do not belong to the repeating part, can be written as a (not necessarily reduced) fraction whose denominator is (10ⁿ − 1)10^k.

Conversely the period of the repeating decimal of a fraction ⁠c/d⁠ will be (at most) the smallest number n such that 10ⁿ − 1 is divisible by d.

For example, the fraction ⁠2/7⁠ has d = 7, and the smallest k that makes 10^k − 1 divisible by 7 is k = 6, because 999999 = 7 × 142857. The period of the fraction ⁠2/7⁠ is therefore 6.

In compressed form

The following picture suggests kind of compression of the above shortcut. Thereby $I$ represents the digits of the integer part of the decimal number (to the left of the decimal point), $A$ makes up the string of digits of the preperiod and $# A$ its length, and $P$ being the string of repeated digits (the period) with length $# P$ which is nonzero.

In the generated fraction, the digit $9$ will be repeated $# P$ times, and the digit $0$ will be repeated $# A$ times.

Note that in the absence of an integer part in the decimal, $I$ will be represented by zero, which being to the left of the other digits, will not affect the final result, and may be omitted in the calculation of the generating function.

Examples:

$\begin{array}{lllll} 3.254444 \dots & = 3.25 \bar{4} & = {\begin{matrix} I = 3 & A = 25 & P = 4 \\ # A = 2 & # P = 1 \end{matrix}} & = \frac{3254 - 325}{900} & = \frac{2929}{900} \\ 0.512512 \dots & = 0. \bar{512} & = {\begin{matrix} I = 0 & A = \emptyset & P = 512 \\ # A = 0 & # P = 3 \end{matrix}} & = \frac{512 - 0}{999} & = \frac{512}{999} \\ 1.09191 \dots & = 1.0 \bar{91} & = {\begin{matrix} I = 1 & A = 0 & P = 91 \\ # A = 1 & # P = 2 \end{matrix}} & = \frac{1091 - 10}{990} & = \frac{1081}{990} \\ 1.333 \dots & = 1. \bar{3} & = {\begin{matrix} I = 1 & A = \emptyset & P = 3 \\ # A = 0 & # P = 1 \end{matrix}} & = \frac{13 - 1}{9} & = \frac{12}{9} & = \frac{4}{3} \\ 0.3789789 \dots & = 0.3 \bar{789} & = {\begin{matrix} I = 0 & A = 3 & P = 789 \\ # A = 1 & # P = 3 \end{matrix}} & = \frac{3789 - 3}{9990} & = \frac{3786}{9990} & = \frac{631}{1665} \end{array}$

The symbol $\emptyset$ in the examples above denotes the absence of digits of part $A$ in the decimal, and therefore $# A = 0$ and a corresponding absence in the generated fraction.

Repeating decimals as infinite series

A repeating decimal can also be expressed as an infinite series. That is, a repeating decimal can be regarded as the sum of an infinite number of rational numbers. To take the simplest example,

0. \bar{1} = \frac{1}{10} + \frac{1}{100} + \frac{1}{1000} + \dots = \sum_{n = 1}^{\infty} \frac{1}{10^{n}}

The above series is a geometric series with the first term as ⁠1/10⁠ and the common factor ⁠1/10⁠. Because the absolute value of the common factor is less than 1, we can say that the geometric series converges and find the exact value in the form of a fraction by using the following formula where a is the first term of the series and r is the common factor.

\frac{a}{1 - r} = \frac{\frac{1}{10}}{1 - \frac{1}{10}} = \frac{1}{10 - 1} = \frac{1}{9}

Similarly,

\begin{matrix} 0. \bar{142857} & = \frac{142857}{10^{6}} + \frac{142857}{10^{12}} + \frac{142857}{10^{18}} + \dots = \sum_{n = 1}^{\infty} \frac{142857}{10^{6 n}} \\ ⟹ & \frac{a}{1 - r} = \frac{\frac{142857}{10^{6}}}{1 - \frac{1}{10^{6}}} = \frac{142857}{10^{6} - 1} = \frac{142857}{999999} = \frac{1}{7} \end{matrix}

Multiplication and cyclic permutation

The cyclic behavior of repeating decimals in multiplication also leads to the construction of integers which are cyclically permuted when multiplied by certain numbers. For example, 102564 × 4 = 410256. 102564 is the repetend of ⁠4/39⁠ and 410256 the repetend of ⁠16/39⁠.

Other properties of repetend lengths

Various properties of repetend lengths (periods) are given by Mitchell and Dickson.

The period of ⁠1/k⁠ for integer k is always ≤ k − 1.
If p is prime, the period of ⁠1/p⁠ divides evenly into p − 1.
If k is composite, the period of ⁠1/k⁠ is strictly less than k − 1.
The period of ⁠c/k⁠, for c coprime to k, equals the period of ⁠1/k⁠.
If k = 2^a·5^bn where n > 1 and n is not divisible by 2 or 5, then the length of the transient of ⁠1/k⁠ is max(a, b), and the period equals r, where r is the multiplicative order of 10 mod n, that is the smallest integer such that 10^r ≡ 1 (mod n).
If p, p′, p″,... are distinct primes, then the period of ⁠1/p p′ p″ ⋯⁠ equals the lowest common multiple of the periods of ⁠1/p⁠, ⁠1/p′⁠, ⁠1/p″⁠,....
If k and k′ have no common prime factors other than 2 or 5, then the period of ⁠1/k k′⁠ equals the least common multiple of the periods of ⁠1/k⁠ and ⁠1/k′⁠.
For prime p, if

period (\frac{1}{p}) = period (\frac{1}{p^{2}}) = \dots = period (\frac{1}{p^{m}})

for some m, but

period (\frac{1}{p^{m}}) \neq period (\frac{1}{p^{m + 1}}),

then for c ≥ 0 we have

period (\frac{1}{p^{m + c}}) = p^{c} \cdot period (\frac{1}{p}) .

If p is a proper prime ending in a 1, that is, if the repetend of ⁠1/p⁠ is a cyclic number of length p − 1 and p = 10h + 1 for some h, then each digit 0, 1, ..., 9 appears in the repetend exactly h = ⁠p − 1/10⁠ times.

For some other properties of repetends, see also.

Extension to other bases

Various features of repeating decimals extend to the representation of numbers in all other integer bases, not just base 10:

Every real number can be represented as an integer part followed by a radix point (the generalization of a decimal point to non-decimal systems) followed by a finite or infinite number of digits.
If the base is an integer, a terminating sequence obviously represents a rational number.
A rational number has a terminating sequence if all the prime factors of the denominator of the fully reduced fractional form are also factors of the base. These numbers make up a dense set in Q and R.
If the positional numeral system is a standard one, that is it has base

b \in Z ∖ {- 1, 0, 1}

combined with a consecutive set of digits

D := {d_{1}, d_{1} + 1, \dots, d_{r}}

with r := |b|, d_r := d₁ + r − 1 and 0 ∈ D, then a terminating sequence is obviously equivalent to the same sequence with non-terminating repeating part consisting of the digit 0. If the base is positive, then there exists an order homomorphism from the lexicographical order of the right-sided infinite strings over the alphabet D into some closed interval of the reals, which maps the strings 0.A₁A₂...A_nd_b and 0.A₁A₂...(A_n+1)d₁ with A_i ∈ D and A_n ≠ d_b to the same real number – and there are no other duplicate images. In the decimal system, for example, there is 0.9 = 1.0 = 1; in the balanced ternary system there is 0.1 = 1.T = ⁠1/2⁠.

A rational number has an indefinitely repeating sequence of finite length l, if the reduced fraction's denominator contains a prime factor that is not a factor of the base. If q is the maximal factor of the reduced denominator which is coprime to the base, l is the smallest exponent such that q divides b^ℓ − 1. It is the multiplicative order ord_q(b) of the residue class b mod q which is a divisor of the Carmichael function λ(q) which in turn is smaller than q. The repeating sequence is preceded by a transient of finite length if the reduced fraction also shares a prime factor with the base. A repeating sequence

{(0. \bar{A_{1} A_{2} \dots A_{ℓ}})}_{b}

represents the fraction

\frac{(A_{1} A_{2} \dots A_{ℓ})_{b}}{b^{ℓ} - 1} .

An irrational number has a representation of infinite length that is not, from any point, an indefinitely repeating sequence of finite length.

For example, in duodecimal, ⁠1/2⁠ = 0.6, ⁠1/3⁠ = 0.4, ⁠1/4⁠ = 0.3 and ⁠1/6⁠ = 0.2 all terminate; ⁠1/5⁠ = 0.2497 repeats with period length 4, in contrast with the equivalent decimal expansion of 0.2; ⁠1/7⁠ = 0.186A35 has period 6 in duodecimal, just as it does in decimal.

If b is an integer base and k is an integer, then

\frac{1}{k} = \frac{1}{b} + \frac{(b - k)^{1}}{b^{2}} + \frac{(b - k)^{2}}{b^{3}} + \frac{(b - k)^{3}}{b^{4}} + \dots + \frac{(b - k)^{N - 1}}{b^{N}} + \dots = \frac{1}{b} \frac{1}{1 - \frac{b - k}{b}} .

For example 1/7 in duodecimal: $\frac{1}{7} = {(\frac{1}{10^{}} + \frac{5}{10^{2}} + \frac{21}{10^{3}} + \frac{A 5}{10^{4}} + \frac{441}{10^{5}} + \frac{1985}{10^{6}} + \dots)}_{base 12}$

which is 0.186A35_base12. 10_base12 is 12_base10, 10²_base12 is 144_base10, 21_base12 is 25_base10, A5_base12 is 125_base10.

Algorithm for positive bases

For a rational 0 < ⁠p/q⁠ < 1 (and base b ∈ N_>1) there is the following algorithm producing the repetend together with its length:

<span id="mwBeg"></span><span class="nv" id="mwBek">function</span><span class="w" id="mwBeo"> </span><span class="nf" id="mwBes">b_adic</span><span class="p" id="mwBew">(</span><span class="nv" id="mwBe0">b</span><span class="o" id="mwBe4">,</span><span class="nv" id="mwBe8">p</span><span class="o" id="mwBfA">,</span><span class="nv" id="mwBfE">q</span><span class="p" id="mwBfI">)</span><span class="w" id="mwBfM"> </span><span class="c1" id="mwBfQ">// b ≥ 2; 0 < p < q</span> <span class="w" id="mwBfU"> </span><span class="nv" id="mwBfY">digits</span><span class="w" id="mwBfc"> </span><span class="o" id="mwBfg">=</span><span class="w" id="mwBfk"> </span><span class="s" id="mwBfo">"0123..."</span><span class="o" id="mwBfs">;</span><span class="w" id="mwBfw"> </span><span class="c1" id="mwBf0">// up to the digit with value b–1</span> <span class="k" id="mwBf4">begin</span> <span class="w" id="mwBf8"> </span><span class="nv" id="mwBgA">s</span><span class="w" id="mwBgE"> </span><span class="o" id="mwBgI">=</span><span class="w" id="mwBgM"> </span><span class="s" id="mwBgQ">""</span><span class="o" id="mwBgU">;</span><span class="w" id="mwBgY"> </span><span class="c1" id="mwBgc">// the string of digits</span> <span class="w" id="mwBgg"> </span><span class="nv" id="mwBgk">pos</span><span class="w" id="mwBgo"> </span><span class="o" id="mwBgs">=</span><span class="w" id="mwBgw"> </span><span class="m" id="mwBg0">0</span><span class="o" id="mwBg4">;</span><span class="w" id="mwBg8"> </span><span class="c1" id="mwBhA">// all places are right to the radix point</span> <span class="w" id="mwBhE"> </span><span class="k" id="mwBhI">while</span><span class="w" id="mwBhM"> </span><span class="ow" id="mwBhQ">not</span><span class="w" id="mwBhU"> </span><span class="nf" id="mwBhY">defined</span><span class="p" id="mwBhc">(</span><span class="nv" id="mwBhg">occurs</span><span class="p" id="mwBhk">[</span><span class="nv" id="mwBho">p</span><span class="p" id="mwBhs">])</span><span class="w" id="mwBhw"> </span><span class="k" id="mwBh0">do</span> <span class="w" id="mwBh4"> </span><span class="nv" id="mwBh8">occurs</span><span class="p" id="mwBiA">[</span><span class="nv" id="mwBiE">p</span><span class="p" id="mwBiI">]</span><span class="w" id="mwBiM"> </span><span class="o" id="mwBiQ">=</span><span class="w" id="mwBiU"> </span><span class="nv" id="mwBiY">pos</span><span class="o" id="mwBic">;</span><span class="w" id="mwBig"> </span><span class="c1" id="mwBik">// the position of the place with remainder p</span> <span class="w" id="mwBio"> </span><span class="nv" id="mwBis">bp</span><span class="w" id="mwBiw"> </span><span class="o" id="mwBi0">=</span><span class="w" id="mwBi4"> </span><span class="nv" id="mwBi8">b</span><span class="o" id="mwBjA">*</span><span class="nv" id="mwBjE">p</span><span class="o" id="mwBjI">;</span> <span class="hll" id="mwBjM"><span class="w" id="mwBjQ"> </span><span class="nv" id="mwBjU">z</span><span class="w" id="mwBjY"> </span><span class="o" id="mwBjc">=</span><span class="w" id="mwBjg"> </span><span class="nf" id="mwBjk">floor</span><span class="p" id="mwBjo">(</span><span class="nv" id="mwBjs">bp</span><span class="o" id="mwBjw">/</span><span class="nv" id="mwBj0">q</span><span class="p" id="mwBj4">)</span><span class="o" id="mwBj8">;</span><span class="w" id="mwBkA"> </span><span class="c1" id="mwBkE">// index z of digit within: 0 ≤ z ≤ b-1</span> </span><span class="hll" id="mwBkI"><span class="w" id="mwBkM"> </span><span class="nv" id="mwBkQ">p</span><span class="w" id="mwBkU"> </span><span class="o" id="mwBkY">=</span><span class="w" id="mwBkc"> </span><span class="nv" id="mwBkg">b</span><span class="o" id="mwBkk">*</span><span class="nv" id="mwBko">p</span><span class="w" id="mwBks"> </span>−<span class="w" id="mwBkw"> </span><span class="nv" id="mwBk0">z</span><span class="o" id="mwBk4">*</span><span class="nv" id="mwBk8">q</span><span class="o" id="mwBlA">;</span><span class="w" id="mwBlE"> </span><span class="c1" id="mwBlI">// 0 ≤ p < q</span> </span><span class="w" id="mwBlM"> </span><span class="k" id="mwBlQ">if</span><span class="w" id="mwBlU"> </span><span class="nv" id="mwBlY">p</span><span class="w" id="mwBlc"> </span><span class="o" id="mwBlg">=</span><span class="w" id="mwBlk"> </span><span class="m" id="mwBlo">0</span><span class="w" id="mwBls"> </span><span class="k" id="mwBlw">then</span><span class="w" id="mwBl0"> </span><span class="nv" id="mwBl4">L</span><span class="w" id="mwBl8"> </span><span class="o" id="mwBmA">=</span><span class="w" id="mwBmE"> </span><span class="m" id="mwBmI">0</span><span class="o" id="mwBmM">;</span> <span class="w" id="mwBmQ"> </span><span class="k" id="mwBmU">if</span><span class="w" id="mwBmY"> </span><span class="ow" id="mwBmc">not</span><span class="w" id="mwBmg"> </span><span class="nv" id="mwBmk">z</span><span class="w" id="mwBmo"> </span><span class="o" id="mwBms">=</span><span class="w" id="mwBmw"> </span><span class="m" id="mwBm0">0</span><span class="w" id="mwBm4"> </span><span class="k" id="mwBm8">then</span> <span class="w" id="mwBnA"> </span><span class="nv" id="mwBnE">s</span><span class="w" id="mwBnI"> </span><span class="o" id="mwBnM">=</span><span class="w" id="mwBnQ"> </span><span class="nv" id="mwBnU">s</span><span class="w" id="mwBnY"> </span><span class="o" id="mwBnc">.</span><span class="w" id="mwBng"> </span><span class="nf" id="mwBnk">substring</span><span class="p" id="mwBno">(</span><span class="nv" id="mwBns">digits</span><span class="o" id="mwBnw">,</span><span class="w" id="mwBn0"> </span><span class="nv" id="mwBn4">z</span><span class="o" id="mwBn8">,</span><span class="w" id="mwBoA"> </span><span class="m" id="mwBoE">1</span><span class="p" id="mwBoI">)</span><span class="w" id="mwBoM"> </span> <span class="w" id="mwBoQ"> </span><span class="k" id="mwBoU">end</span><span class="w" id="mwBoY"> </span><span class="k" id="mwBoc">if</span> <span class="w" id="mwBog"> </span><span class="nf" id="mwBok">return</span> <span class="p" id="mwBoo">(</span><span class="nv" id="mwBos">s</span><span class="p" id="mwBow">)</span><span class="o" id="mwBo0">;</span> <span class="w" id="mwBo4"> </span><span class="k" id="mwBo8">end</span><span class="w" id="mwBpA"> </span><span class="k" id="mwBpE">if</span> <span class="w" id="mwBpI"> </span><span class="nv" id="mwBpM">s</span><span class="w" id="mwBpQ"> </span><span class="o" id="mwBpU">=</span><span class="w" id="mwBpY"> </span><span class="nv" id="mwBpc">s</span><span class="w" id="mwBpg"> </span><span class="o" id="mwBpk">.</span><span class="w" id="mwBpo"> </span><span class="nf" id="mwBps">substring</span><span class="p" id="mwBpw">(</span><span class="nv" id="mwBp0">digits</span><span class="o" id="mwBp4">,</span><span class="w" id="mwBp8"> </span><span class="nv" id="mwBqA">z</span><span class="o" id="mwBqE">,</span><span class="w" id="mwBqI"> </span><span class="m" id="mwBqM">1</span><span class="p" id="mwBqQ">)</span><span class="o" id="mwBqU">;</span><span class="w" id="mwBqY"> </span><span class="c1" id="mwBqc">// append the character of the digit</span> <span class="w" id="mwBqg"> </span><span class="nv" id="mwBqk">pos</span><span class="w" id="mwBqo"> </span><span class="o" id="mwBqs">+=</span><span class="w" id="mwBqw"> </span><span class="m" id="mwBq0">1</span><span class="o" id="mwBq4">;</span> <span class="w" id="mwBq8"> </span><span class="k" id="mwBrA">end</span><span class="w" id="mwBrE"> </span><span class="k" id="mwBrI">while</span> <span class="w" id="mwBrM"> </span><span class="nv" id="mwBrQ">L</span><span class="w" id="mwBrU"> </span><span class="o" id="mwBrY">=</span><span class="w" id="mwBrc"> </span><span class="nv" id="mwBrg">pos</span><span class="w" id="mwBrk"> </span><span class="o" id="mwBro">-</span><span class="w" id="mwBrs"> </span><span class="nv" id="mwBrw">occurs</span><span class="p" id="mwBr0">[</span><span class="nv" id="mwBr4">p</span><span class="p" id="mwBr8">]</span><span class="o" id="mwBsA">;</span><span class="w" id="mwBsE"> </span><span class="c1" id="mwBsI">// the length of the repetend (being < q)</span> <span class="w" id="mwBsM"> </span><span class="c1" id="mwBsQ">// mark the digits of the repetend by a vinculum:</span> <span class="w" id="mwBsU"> </span><span class="k" id="mwBsY">for</span><span class="w" id="mwBsc"> </span><span class="nv" id="mwBsg">i</span><span class="w" id="mwBsk"> </span><span class="k" id="mwBso">from</span><span class="w" id="mwBss"> </span><span class="nv" id="mwBsw">occurs</span><span class="p" id="mwBs0">[</span><span class="nv" id="mwBs4">p</span><span class="p" id="mwBs8">]</span><span class="w" id="mwBtA"> </span><span class="k" id="mwBtE">to</span><span class="w" id="mwBtI"> </span><span class="nv" id="mwBtM">pos</span><span class="o" id="mwBtQ">-</span><span class="m" id="mwBtU">1</span><span class="w" id="mwBtY"> </span><span class="k" id="mwBtc">do</span> <span class="w" id="mwBtg"> </span><span class="nf" id="mwBtk">substring</span><span class="p" id="mwBto">(</span><span class="nv" id="mwBts">s</span><span class="o" id="mwBtw">,</span><span class="w" id="mwBt0"> </span><span class="nv" id="mwBt4">i</span><span class="o" id="mwBt8">,</span><span class="w" id="mwBuA"> </span><span class="m" id="mwBuE">1</span><span class="p" id="mwBuI">)</span><span class="w" id="mwBuM"> </span><span class="o" id="mwBuQ">=</span><span class="w" id="mwBuU"> </span><span class="nf" id="mwBuY">overline</span><span class="p" id="mwBuc">(</span><span class="nf" id="mwBug">substring</span><span class="p" id="mwBuk">(</span><span class="nv" id="mwBuo">s</span><span class="o" id="mwBus">,</span><span class="w" id="mwBuw"> </span><span class="nv" id="mwBu0">i</span><span class="o" id="mwBu4">,</span><span class="w" id="mwBu8"> </span><span class="m" id="mwBvA">1</span><span class="p" id="mwBvE">))</span><span class="o" id="mwBvI">;</span> <span class="w" id="mwBvM"> </span><span class="k" id="mwBvQ">end</span><span class="w" id="mwBvU"> </span><span class="k" id="mwBvY">for</span> <span class="w" id="mwBvc"> </span><span class="nf" id="mwBvg">return</span> <span class="p" id="mwBvk">(</span><span class="nv" id="mwBvo">s</span><span class="p" id="mwBvs">)</span><span class="o" id="mwBvw">;</span> <span class="k" id="mwBv0">end</span><span class="w" id="mwBv4"> </span><span class="nv" id="mwBv8">function</span>

The first highlighted line calculates the digit z.

The subsequent line calculates the new remainder p′ of the division modulo the denominator q. As a consequence of the floor function floor we have

\frac{b p}{q} - 1 < z = ⌊ \frac{b p}{q} ⌋ \leq \frac{b p}{q},

thus

b p - q < z q ⟹ p^{'} := b p - z q < q

and

z q \leq b p ⟹ 0 \leq b p - z q =: p^{'} .

Because all these remainders p are non-negative integers less than q, there can be only a finite number of them with the consequence that they must recur in the while loop. Such a recurrence is detected by the associative array occurs. The new digit z is formed in the yellow line, where p is the only non-constant. The length L of the repetend equals the number of the remainders (see also section Every rational number is either a terminating or repeating decimal).