Repeating decimal

Thereby fraction is the unit fraction 1/n and ℓ₁₀ is the length of the (decimal) repetend.

The lengths ℓ₁₀(n) of the decimal repetends of 1/n, n = 1, 2, 3, ..., are:

0, 0, 1, 0, 0, 1, 6, 0, 1, 0, 2, 1, 6, 6, 1, 0, 16, 1, 18, 0, 6, 2, 22, 1, 0, 6, 3, 6, 28, 1, 15, 0, 2, 16, 6, 1, 3, 18, 6, 0, 5, 6, 21, 2, 1, 22, 46, 1, 42, 0, 16, 6, 13, 3, 2, 6, 18, 28, 58, 1, 60, 15, 6, 0, 6, 2, 33, 16, 22, 6, 35, 1, 8, 3, 1, ... (sequence A051626 in the OEIS).

For comparison, the lengths ℓ₂(n) of the binary repetends of the fractions 1/n, n = 1, 2, 3, ..., are:

0, 0, 2, 0, 4, 2, 3, 0, 6, 4, 10, 2, 12, 3, 4, 0, 8, 6, 18, 4, 6, 10, 11, 2, 20, 12, 18, 3, 28, 4, 5, 0, 10, 8, 12, 6, 36, 18, 12, 4, 20, 6, 14, 10, 12, 11, ... (=A007733[n], if n not a power of 2 else =0).

The decimal repetends of 1/n, n = 1, 2, 3, ..., are:

0, 0, 3, 0, 0, 6, 142857, 0, 1, 0, 09, 3, 076923, 714285, 6, 0, 0588235294117647, 5, 052631578947368421, 0, 047619, 45, 0434782608695652173913, 6, 0, 384615, 037, 571428, 0344827586206896551724137931, 3, ... (sequence A036275 in the OEIS).

The decimal repetend lengths of 1/p, p = 2, 3, 5, ... (nth prime), are:

0, 1, 0, 6, 2, 6, 16, 18, 22, 28, 15, 3, 5, 21, 46, 13, 58, 60, 33, 35, 8, 13, 41, 44, 96, 4, 34, 53, 108, 112, 42, 130, 8, 46, 148, 75, 78, 81, 166, 43, 178, 180, 95, 192, 98, 99, 30, 222, 113, 228, 232, 7, 30, 50, 256, 262, 268, 5, 69, 28, ... (sequence A002371 in the OEIS).

The least primes p for which 1/p has decimal repetend length n, n = 1, 2, 3, ..., are:

3, 11, 37, 101, 41, 7, 239, 73, 333667, 9091, 21649, 9901, 53, 909091, 31, 17, 2071723, 19, 1111111111111111111, 3541, 43, 23, 11111111111111111111111, 99990001, 21401, 859, 757, 29, 3191, 211, ... (sequence A007138 in the OEIS).

The least primes p for which k/p has n different cycles (1 ≤ k ≤ p−1), n = 1, 2, 3, ..., are:

7, 3, 103, 53, 11, 79, 211, 41, 73, 281, 353, 37, 2393, 449, 3061, 1889, 137, 2467, 16189, 641, 3109, 4973, 11087, 1321, 101, 7151, 7669, 757, 38629, 1231, ... (sequence A054471 in the OEIS).

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, the repetend length is equal to p − 1; if not, 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 repetend of the reciprocal of any prime number greater than 5 is divisible by 9.[4]

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.

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

${\displaystyle a^{m}\equiv 1{\pmod {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).[7]

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

${\displaystyle {\frac {1}{p^{k}q^{\ell }r^{m}\cdots }}}$

is a repeating decimal with a period of

${\displaystyle \operatorname {LCM} (T_{p^{k}},T_{q^{\ell }},T_{r^{m}},\ldots )}$

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.

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:

${\displaystyle {\frac {1}{2^{a}5^{b}p^{k}q^{\ell }\cdots }}\,,}$

where a and b are not both zero.

This fraction can also be expressed as:

${\displaystyle {\frac {5^{a-b}}{10^{a}p^{k}q^{\ell }\cdots }}\,,}$

if a > b, or as

${\displaystyle {\frac {2^{b-a}}{10^{b}p^{k}q^{\ell }\cdots }}\,,}$

if b > a, or as

${\displaystyle {\frac {1}{10^{a}p^{k}q^{\ell }\cdots }}\,,}$

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.

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

${\displaystyle x}$	${\displaystyle =0.333333\ldots }$
${\displaystyle 10x}$	${\displaystyle =3.333333\ldots }$	(multiply each side of the above line by 10)
${\displaystyle 9x}$	${\displaystyle =3}$	(subtract the 1st line from the 2nd)
${\displaystyle x}$	${\displaystyle ={\frac {3}{9}}={\frac {1}{3}}}$	(reduce to lowest terms)

Another example:

${\displaystyle x}$	${\displaystyle =\ \ \ \ 0.836363636\ldots }$
${\displaystyle 10x}$	${\displaystyle =\ \ \ \ 8.36363636\ldots }$	(move decimal to start of repetition = move by 1 place = multiply by 10)
${\displaystyle 1000x}$	${\displaystyle =836.36363636\ldots }$	(collate 2nd repetition here with 1st above = move by 2 places = multiply by 100)
${\displaystyle 990x}$	${\displaystyle =828}$	(subtract to clear decimals)
${\displaystyle x}$	${\displaystyle ={\frac {828}{990}}={\frac {18\cdot 46}{18\cdot 55}}={\frac {46}{55}}}$	(reduce to lowest terms)

In compressed form

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

Formation Rule

In the generated fraction, the digit ${\displaystyle 9}$ will be repeated ${\displaystyle \#\mathbf {P} }$ times, and the digit ${\displaystyle 0}$ will be repeated ${\displaystyle \#\mathbf {A} }$ times.

Note that in the absence of an integer part in the decimal, ${\displaystyle \mathbf {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:

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

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

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,

${\displaystyle 0.{\overline {1}}={\frac {1}{10}}+{\frac {1}{100}}+{\frac {1}{1000}}+\cdots =\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.

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

Similarly,

${\displaystyle {\begin{aligned}0.{\overline {142857}}&={\frac {142857}{10^{6}}}+{\frac {142857}{10^{12}}}+{\frac {142857}{10^{18}}}+\cdots =\sum _{n=1}^{\infty }{\frac {142857}{10^{6n}}}\\[6px]\implies &\quad {\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{aligned}}}$

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.

Various properties of repetend lengths (periods) are given by Mitchell[8] and Dickson.[9]

• 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^a5^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 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

${\displaystyle {\text{period}}\left({\frac {1}{p}}\right)={\text{period}}\left({\frac {1}{p^{2}}}\right)=\cdots ={\text{period}}\left({\frac {1}{p^{m}}}\right)}$

for some m, but

${\displaystyle {\text{period}}\left({\frac {1}{p^{m}}}\right)\neq {\text{period}}\left({\frac {1}{p^{m+1}}}\right),}$

then for c ≥ 0 we have

${\displaystyle {\text{period}}\left({\frac {1}{p^{m+c}}}\right)=p^{c}\cdot {\text{period}}\left({\frac {1}{p}}\right).}$

• 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.[10]

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

• Any 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

${\displaystyle b\in \mathbb {Z} \smallsetminus \{-1,0,1\}}$

combined with a consecutive set of digits

${\displaystyle 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^l − 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

${\displaystyle \left(0.{\overline {A_{1}A_{2}\ldots A_{\ell }}}\right)_{b}}$

represents the fraction

${\displaystyle {\frac {(A_{1}A_{2}\ldots A_{\ell })_{b}}{b^{l}-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

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

For example 1/7 in duodecimal:

1/7 = (1/10 + 5/10² + 21/10³ + A5/10⁴ + 441/10⁵ + 1985/10⁶ + ...)_base12

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.

function b_adic(b,p,q) // b ≥ 2; 0 < p < q
  static digits = "0123..."; // up to the digit with value b–1
begin
  s = "";  // the string of digits
  pos = 0; // all places are right to the radix point
  while not defined(occurs[p]) do
    occurs[p] = pos; // the position of the place with remainder p
    bp = b*p;
    z = floor(bp/q); // index z of digit within: 0 ≤ z ≤ b-1
    p = b*p − z*q;   // 0 ≤ p < q
    if p = 0 then L = 0;
      if not z = 0 then
        s = s . substring(digits, z, 1) 
      end if
      return (s);
     end if
    s = s . substring(digits, z, 1); // append the character of the digit
    pos += 1;
  end while
  L = pos - occurs[p]; // the length of the repetend (being < q)
  // mark the digits of the repetend by a vinculum:
  for i from occurs[p] to pos-1 do
    substring(s, i, 1) = overline(substring(s, i, 1));
  end for
  return (s);
end function

Repeating decimals (also called decimal sequences) have found cryptographic and error-correction coding applications.[11] In these applications repeating decimals to base 2 are generally used which gives rise to binary sequences. The maximum length binary sequence for 1/p (when 2 is a primitive root of p) is given by:[12]

${\displaystyle a(i)=2^{i}{\bmod {p}}{\bmod {2}}}$

These sequences of period p − 1 have an autocorrelation function that has a negative peak of −1 for shift of p − 1/2. The randomness of these sequences has been examined by diehard tests.[13]

• Decimal representation
• Full reptend prime
• Midy's theorem
• Parasitic number
• Trailing zero
• Unique prime
• 0.999..., a repeating decimal equal to one
• Pigeonhole principle

• Weisstein, Eric W. "Repeating Decimal". MathWorld.