Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Repeating decimal

From Wikipedia, the free encyclopedia
Decimal representation of a number whose digits are periodic
"Repeating fraction" redirects here; not to be confused withcontinued fraction.
This article has multiple issues. Please helpimprove it or discuss these issues on thetalk page.(Learn how and when to remove these messages)
icon
This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Repeating decimal" – news ·newspapers ·books ·scholar ·JSTOR
(July 2023) (Learn how and when to remove this message)
This article mayrequirecleanup to meet Wikipedia'squality standards. The specific problem is:The article is polluted with multiple non-encyclopedic tables, often placed before the true content that is hidden by them. Section are placed in a random order with the most important facts relegated toward the end of the article. Please helpimprove this article if you can.(July 2024) (Learn how and when to remove this message)
(Learn how and when to remove this message)

Arepeating decimal orrecurring decimal is adecimal representation of a number whosedigits are eventuallyperiodic (that is, after some place, the same sequence of digits is repeated forever); if this sequence consists only of zeros (that is if there are only a finite number of nonzero digits), the decimal is said to beterminating, and is not considered as repeating.

It can be shown that a number isrational if and only if its decimal representation is repeating or terminating. For example, the decimal representation of1/3 becomes periodic just after thedecimal point, repeating the single digit "3" forever, i.e. 0.333.... A more complicated example is3227/555, whose decimal becomes periodic at thesecond digit following the decimal point and then repeats the sequence "144" forever, i.e. 5.8144144144.... Another example of this is593/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 therepetend orreptend. If the repetend is a zero, this decimal representation is called aterminating decimal rather than a repeating decimal, since the zeros can be omitted and the decimal terminates before these zeros.[1] Every terminating decimal representation can be written as adecimal fraction, a fraction whose denominator is apower of 10 (e.g.1.585 =1585/1000); it may also be written as aratio of the formk/2n·5m (e.g.1.585 =317/23·52). 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 are1.000... = 0.999... and1.585000... = 1.584999.... (This type of repeating decimal can be obtained by long division if one uses a modified form of the usualdivision algorithm.[2])

Any number that cannot be expressed as aratio of twointegers is said to beirrational. 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 are2 andπ.[3]

Background

[edit]

Notation

[edit]
icon
This sectionneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources in this section. Unsourced material may be challenged and removed.(October 2024) (Learn how and when to remove this message)

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.

Different notations with examples
FractionVinculumDotsParenthesesArcEllipsis
1/90.10..10.(1)0.10.111...
1/3=3/90.30..30.(3)0.30.333...
2/3=6/90.60..60.(6)0.60.666...
9/11=81/990.810..8.10.(81)0.810.8181...
7/12=525/9000.5830.58.30.58(3)0.5830.58333...
1/7=142857/9999990.1428570..14285.70.(142857)0.1428570.142857142857...
1/81=12345679/9999999990.0123456790..01234567.90.(012345679)0.0123456790.012345679012345679...
22/7=3142854/9999993.1428573..14285.73.(142857)3.1428573.142857142857...
593/53=111886792452819/999999999999911.188679245283011..188679245283.011.(1886792452830)11.188679245283011.18867924528301886792452830...

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". Likewise, 11.1886792452830 may be read "eleven point repeating one double eight six seven nine two four five two eight three zero", "eleven point repeated one double eight six seven nine two four five two eight three zero", "eleven point recurring one double eight six seven nine two four five two eight three zero" "eleven point repetend one double eight six seven nine two four five two eight three zero" or "eleven point into infinity one double eight six seven nine two four five two eight three zero".

Decimal expansion and recurrence sequence

[edit]

In order to convert arational number represented as a fraction into decimal form, one may uselong division. For example, consider the rational number5/74:

  0.0675   74 ) 5.000004.44          560518           420370            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 fractionA/B, the remainder at step k, for any positive integerk, isA × 10k (moduloB).

Every rational number is either a terminating or repeating decimal

[edit]

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".[5]

In base 10, a fraction has a repeating decimal if and only ifin 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 2m5n, wherem andn are non-negative integers.

Every repeating or terminating decimal is a rational number

[edit]

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

10000α − 10α= 58144.144144... − 58.144144...
9990α= 58086
Therefore,α=58086/9990 =3227/555

The process of how to find these integer coefficients is describedbelow.

Formal proof

[edit]

Given a repeating decimalx=a.bc¯{\displaystyle x=a.b{\overline {c}}} wherea{\displaystyle a},b{\displaystyle b}, andc{\displaystyle c} are groups of digits, letn=log10b{\displaystyle n=\lceil {\log _{10}b}\rceil }, the number of digits ofb{\displaystyle b}. Multiplying by10n{\displaystyle 10^{n}} separates the repeating and terminating groups:

10nx=ab.c¯.{\displaystyle 10^{n}x=ab.{\bar {c}}.}

If the decimals terminate (c=0{\displaystyle c=0}), the proof is complete.[6] Forc0{\displaystyle c\neq 0} withkN{\displaystyle k\in \mathbb {N} } digits, letx=y.c¯{\displaystyle x=y.{\bar {c}}} whereyZ{\displaystyle y\in \mathbb {Z} } is a terminating group of digits. Then,

c=d1d2...dk{\displaystyle c=d_{1}d_{2}\,...d_{k}}

wheredi{\displaystyle d_{i}} denotes thei-thdigit, and

x=y+n=1c(10k)n=y+(cn=01(10k)n)c.{\displaystyle x=y+\sum _{n=1}^{\infty }{\frac {c}{{(10^{k})}^{n}}}=y+\left(c\sum _{n=0}^{\infty }{\frac {1}{{(10^{k})}^{n}}}\right)-c.}

Sincen=01(10k)n=1110k{\displaystyle \textstyle \sum _{n=0}^{\infty }{\frac {1}{{(10^{k})}^{n}}}={\frac {1}{1-10^{-k}}}},[7]

x=yc+10kc10k1.{\displaystyle x=y-c+{\frac {10^{k}c}{10^{k}-1}}.}

Sincex{\displaystyle x} is the sum of an integer (yc{\displaystyle y-c}) and a rational number (10kc10k1{\textstyle {\frac {10^{k}c}{10^{k}-1}}}),x{\displaystyle x} is also rational.[8]

Fractions with prime denominators

[edit]
Main article:Reciprocals of primes

A fractionin lowest terms with aprime 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) of1/p is equal to theorder of 10 modulop. If 10 is aprimitive root modulop, then the repetend length is equal top − 1; if not, then the repetend length is a factor ofp − 1. This result can be deduced fromFermat's little theorem, which states that10p−1 ≡ 1 (modp).

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

If the repetend length of1/p for primep is equal top − 1 then the repetend, expressed as an integer, is called acyclic number.

Cyclic numbers

[edit]
Main article:Cyclic number

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 fractions1/109,1/113,1/131,1/149,1/167,1/179,1/181,1/193,1/223,1/229, etc. (sequenceA001913 in theOEIS).

Everyproper 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 of1/7: the sequential remainders are the cyclic sequence{1, 3, 2, 6, 4, 5}. See also the article142,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 innines' complement form. For example1/7 starts '142' and is followed by '857' while6/7 (by rotation) starts '857' followed byits 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 anynatural number n will be, as long as the repetend is known.

Aproper prime is a primep which ends in the digit 1 in base 10 and whose reciprocal in base 10 has a repetend with lengthp − 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:[10]: 166 

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,... (sequenceA073761 in theOEIS).

A prime is a proper prime if and only if it is afull reptend prime andcongruent to 1 mod 10.

If a primep is bothfull reptend prime andsafe prime, then1/p will produce a stream ofp − 1pseudo-random digits. Those primes are

7, 23, 47, 59, 167, 179, 263, 383, 503, 863, 887, 983, 1019, 1367, 1487, 1619, 1823, 2063... (sequenceA000353 in theOEIS).

Other reciprocals of primes

[edit]

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.

(sequenceA006559 in theOEIS)

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 of1/p, we can check whether the primep divides some number 999...999 in which the number of digits dividesp − 1. Since the period is never greater thanp − 1, we can obtain this by calculating10p−1 − 1/p. For example, for 11 we get

10111111=909090909{\displaystyle {\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 of1/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 primep consists ofn subsets, each with repetend length k, wherenk = p − 1.

Totient rule

[edit]

For an arbitrary integern, the lengthL(n) of the decimal repetend of1/n dividesφ(n), whereφ is thetotient function. The length is equal toφ(n) if and only if 10 is aprimitive root modulon.[11]

In particular, it follows thatL(p) =p − 1if and only ifp is a prime and 10 is a primitive root modulop. Then, the decimal expansions ofn/p forn = 1, 2, ...,p − 1, all have periodp − 1 and differ only by a cyclic permutation. Such numbersp are calledfull repetend primes.

Reciprocals of composite integers coprime to 10

[edit]

Ifp is a prime other than 2 or 5, the decimal representation of the fraction1/p2 repeats:

1/49 = 0.020408163265306122448979591836734693877551.

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

am1(modn){\displaystyle a^{m}\equiv 1{\pmod {n}}}

for every integera that iscoprime ton.

The period of1/p2 is usuallypTp, whereTp is the period of1/p. There are three known primes for which this is not true, and for those the period of1/p2 is the same as the period of1/p becausep2 divides 10p−1−1. These three primes are 3, 487, and 56598313 (sequenceA045616 in theOEIS).[12]

Similarly, the period of1/pk is usuallypk–1Tp

Ifp andq are primes other than 2 or 5, the decimal representation of the fraction1/pq repeats. An example is1/119:

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

where LCM denotes theleast common multiple.

The periodT of1/pq is a factor ofλ(pq) and it happens to be 48 in this case:

1/119 = 0.008403361344537815126050420168067226890756302521.

The periodT of1/pq is LCM(TpTq), whereTp is the period of1/p andTq is the period of1/q.

Ifp,q,r, etc. are primes other than 2 or 5, andk,,m, etc. are positive integers, then

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

is a repeating decimal with a period of

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

whereTpk,Tq,Trm,... are respectively the period of the repeating decimals1/pk,1/q,1/rm,... as defined above.

Reciprocals of integers not coprime to 10

[edit]

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:

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

wherea andb are not both zero.

This fraction can also be expressed as:

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

ifa >b, or as

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

ifb >a, or as

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

ifa =b.

The decimal has:

  • An initial transient of max(ab) 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 fraction1/pkq.

For example1/28 = 0.03571428:

  • a = 2,b = 0, and the other factorspkq ⋯ = 7
  • there are 2 initial non-repeating digits, 03; and
  • there are 6 repeating digits, 571428, the same amount as1/7 has.

Converting repeating decimals to fractions

[edit]

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

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

Another example:

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

A shortcut

[edit]

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

x=0.000000100000010000001107x=1.000000100000010000001(1071)x=9999999x=1x=11071=19999999{\displaystyle {\begin{aligned}x&=0.000000100000010000001\ldots \\10^{7}x&=1.000000100000010000001\ldots \\\left(10^{7}-1\right)x=9999999x&=1\\x&={\frac {1}{10^{7}-1}}={\frac {1}{9999999}}\end{aligned}}}

So this particular repeating decimal corresponds to the fraction1/10n − 1, where the denominator is the number written asn 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:

7.48181818=7.3+0.18181818=7310+1899=7310+92911=7310+211=1173+1021011=823110{\displaystyle {\begin{aligned}7.48181818\ldots &=7.3+0.18181818\ldots \\[8pt]&={\frac {73}{10}}+{\frac {18}{99}}={\frac {73}{10}}+{\frac {9\cdot 2}{9\cdot 11}}={\frac {73}{10}}+{\frac {2}{11}}\\[12pt]&={\frac {11\cdot 73+10\cdot 2}{10\cdot 11}}={\frac {823}{110}}\end{aligned}}}

or

11.18867924528301886792452830=11+0.18867924528301886792452830=11+1053=1153+1053=59353{\displaystyle {\begin{aligned}11.18867924528301886792452830\ldots &=11+0.18867924528301886792452830\ldots \\[8pt]&=11+{\frac {10}{53}}={\frac {11\cdot 53+10}{53}}={\frac {593}{53}}\end{aligned}}}

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

x=0.a1a2an¯10nx=a1a2an.a1a2an¯(10n1)x=9999x=a1a2anx=a1a2an10n1=a1a2an9999{\displaystyle {\begin{aligned}x&=0.{\overline {a_{1}a_{2}\cdots a_{n}}}\\10^{n}x&=a_{1}a_{2}\cdots a_{n}.{\overline {a_{1}a_{2}\cdots a_{n}}}\\[5pt]\left(10^{n}-1\right)x=99\cdots 99x&=a_{1}a_{2}\cdots a_{n}\\[5pt]x&={\frac {a_{1}a_{2}\cdots a_{n}}{10^{n}-1}}={\frac {a_{1}a_{2}\cdots a_{n}}{99\cdots 99}}\end{aligned}}}

More explicitly, one gets the following cases:

If the repeating decimal is between 0 and 1, and the repeating block isn digits long, first occurring right after the decimal point, then the fraction (not necessarily reduced) will be the integer number represented by then-digit block divided by the one represented byn 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 to4/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 arek (extra) digits 0 between the decimal point and the repeatingn-digit block, then one can simply addk digits 0 after then 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 withperiodn, andk 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 (10n − 1)10k.

Conversely the period of the repeating decimal of a fractionc/d will be (at most) the smallest numbern such that 10n − 1 is divisible byd.

For example, the fraction2/7 hasd = 7, and the smallestk that makes 10k − 1 divisible by 7 isk = 6, because 999999 = 7 × 142857. The period of the fraction2/7 is therefore 6.

In compressed form

[edit]

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

Formation rule

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

Note that in the absence of aninteger part in the decimal,I{\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 thegenerating function.

Examples:

3.254444=3.254¯={I=3A=25P=4#A=2#P=1}=3254325900=29299000.512512=0.512¯={I=0A=P=512#A=0#P=3}=5120999=5129991.09191=1.091¯={I=1A=0P=91#A=1#P=2}=109110990=10819901.333=1.3¯={I=1A=P=3#A=0#P=1}=1319=129=430.3789789=0.3789¯={I=0A=3P=789#A=1#P=3}=378939990=37869990=6311665{\displaystyle {\begin{array}{lllll}3.254444\ldots &=3.25{\overline {4}}&={\begin{Bmatrix}\mathbf {I} =3&\mathbf {A} =25&\mathbf {P} =4\\&\#\mathbf {A} =2&\#\mathbf {P} =1\end{Bmatrix}}&={\dfrac {3254-325}{900}}&={\dfrac {2929}{900}}\\\\0.512512\ldots &=0.{\overline {512}}&={\begin{Bmatrix}\mathbf {I} =0&\mathbf {A} =\emptyset &\mathbf {P} =512\\&\#\mathbf {A} =0&\#\mathbf {P} =3\end{Bmatrix}}&={\dfrac {512-0}{999}}&={\dfrac {512}{999}}\\\\1.09191\ldots &=1.0{\overline {91}}&={\begin{Bmatrix}\mathbf {I} =1&\mathbf {A} =0&\mathbf {P} =91\\&\#\mathbf {A} =1&\#\mathbf {P} =2\end{Bmatrix}}&={\dfrac {1091-10}{990}}&={\dfrac {1081}{990}}\\\\1.333\ldots &=1.{\overline {3}}&={\begin{Bmatrix}\mathbf {I} =1&\mathbf {A} =\emptyset &\mathbf {P} =3\\&\#\mathbf {A} =0&\#\mathbf {P} =1\end{Bmatrix}}&={\dfrac {13-1}{9}}&={\dfrac {12}{9}}&={\dfrac {4}{3}}\\\\0.3789789\ldots &=0.3{\overline {789}}&={\begin{Bmatrix}\mathbf {I} =0&\mathbf {A} =3&\mathbf {P} =789\\&\#\mathbf {A} =1&\#\mathbf {P} =3\end{Bmatrix}}&={\dfrac {3789-3}{9990}}&={\dfrac {3786}{9990}}&={\dfrac {631}{1665}}\end{array}}}

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

Repeating decimals as infinite series

[edit]

A repeating decimal can also be expressed as aninfinite 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.1¯=110+1100+11000+=n=1110n{\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 ageometric series with the first term as1/10 and the common factor1/10. Because the absolute value of the common factor is less than 1, we can say that the geometric seriesconverges and find the exact value in the form of a fraction by using the following formula wherea is the first term of the series andr is the common factor.

a1r=1101110=1101=19{\displaystyle {\frac {a}{1-r}}={\frac {\frac {1}{10}}{1-{\frac {1}{10}}}}={\frac {1}{10-1}}={\frac {1}{9}}}

Similarly,

0.142857¯=142857106+1428571012+1428571018+=n=1142857106na1r=14285710611106=1428571061=142857999999=17{\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}}}

Multiplication and cyclic permutation

[edit]
Main article:Transposable integer

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

Other properties of repetend lengths

[edit]

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

  • The period of1/k for integerk is always ≤ k − 1.
  • Ifp is prime, the period of1/p divides evenly intop − 1.
  • Ifk is composite, the period of1/k is strictly less thank − 1.
  • The period ofc/k, forccoprime tok, equals the period of1/k.
  • Ifk = 2a·5bn wheren > 1 andn is not divisible by 2 or 5, then the length of the transient of1/k is max(ab), and the period equalsr, wherer is themultiplicative order of 10 mod n, that is the smallest integer such that10r ≡ 1 (modn).
  • Ifp,p′,p″,... are distinct primes, then the period of1/pp′p″ equals the lowest common multiple of the periods of1/p,1/p′,1/p″,....
  • Ifk andk′ have no common prime factors other than 2 or 5, then the period of1/k k′ equals the least common multiple of the periods of1/k and1/k′.
  • For primep, if
period(1p)=period(1p2)==period(1pm){\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 somem, but
period(1pm)period(1pm+1),{\displaystyle {\text{period}}\left({\frac {1}{p^{m}}}\right)\neq {\text{period}}\left({\frac {1}{p^{m+1}}}\right),}
then forc ≥ 0 we have
period(1pm+c)=pcperiod(1p).{\displaystyle {\text{period}}\left({\frac {1}{p^{m+c}}}\right)=p^{c}\cdot {\text{period}}\left({\frac {1}{p}}\right).}
  • Ifp is aproper prime ending in a 1, that is, if the repetend of1/p is a cyclic number of lengthp − 1 andp = 10h + 1 for someh, then each digit 0, 1, ..., 9 appears in the repetend exactlyhp − 1/10 times.

For some other properties of repetends, see also.[15]

Extension to other bases

[edit]

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

  • Everyreal number can be represented as an integer part followed by aradix point (the generalization of adecimal point to non-decimal systems) followed by a finite or infinite number ofdigits.
  • If the base is an integer, aterminating 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 adense set inQ andR.
  • If thepositional numeral system is a standard one, that is it has base
bZ{1,0,1}{\displaystyle b\in \mathbb {Z} \smallsetminus \{-1,0,1\}}
combined with a consecutive set of digits
D:={d1,d1+1,,dr}{\displaystyle D:=\{d_{1},d_{1}+1,\dots ,d_{r}\}}
withr := |b|,dr := d1 +r − 1 and0 ∈D, then a terminating sequence is obviously equivalent to the same sequence withnon-terminating repeating part consisting of the digit 0. If the base is positive, then there exists anorder homomorphism from thelexicographical order of theright-sided infinite strings over thealphabetD into some closed interval of the reals, which maps the strings0.A1A2...Andb and0.A1A2...(An+1)d1 withAiD andAndb 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 thebalanced ternary system there is 0.1 = 1.T = 1/2.
  • A rational number has an indefinitely repeating sequence of finite lengthl, if the reduced fraction's denominator contains a prime factor that is not a factor of the base. Ifq is the maximal factor of the reduced denominator which is coprime to the base,l is the smallest exponent such thatq dividesb − 1. It is themultiplicative orderordq(b) of the residue classb modq which is a divisor of theCarmichael functionλ(q) which in turn is smaller thanq. 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.A1A2A¯)b{\displaystyle \left(0.{\overline {A_{1}A_{2}\ldots A_{\ell }}}\right)_{b}}
represents the fraction
(A1A2A)bb1.{\displaystyle {\frac {(A_{1}A_{2}\ldots A_{\ell })_{b}}{b^{\ell }-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, induodecimal,1/2 = 0.6,1/3 = 0.4,1/4 = 0.3 and1/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.

Ifb is an integer base andk is an integer, then

1k=1b+(bk)1b2+(bk)2b3+(bk)3b4++(bk)N1bN+=1b11bkb.{\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:17=(1101+5102+21103+A5104+441105+1985106+)base 12{\displaystyle {\frac {1}{7}}=\left({\frac {1}{10^{\phantom {1}}}}+{\frac {5}{10^{2}}}+{\frac {21}{10^{3}}}+{\frac {A5}{10^{4}}}+{\frac {441}{10^{5}}}+{\frac {1985}{10^{6}}}+\cdots \right)_{\text{base 12}}}

which is 0.186A35base12. 10base12 is 12base10, 102base12 is 144base10, 21base12 is 25base10, A5base12 is 125base10.

Algorithm for positive bases

[edit]

For a rational0 <p/q < 1 (and basebN>1) there is the following algorithm producing the repetend together with its length:

functionb_adic(b,p,q)// b ≥ 2; 0 < p < qdigits="0123...";// up to the digit with value b–1begins="";// the string of digitspos=0;// all places are right to the radix pointwhilenotdefined(occurs[p])dooccurs[p]=pos;// the position of the place with remainder pbp=b*p;z=floor(bp/q);// index z of digit within: 0 ≤ z ≤ b-1p=b*pz*q;// 0 ≤ p < qifp=0thenL=0;ifnotz=0thens=s.substring(digits,z,1)endifreturn(s);endifs=s.substring(digits,z,1);// append the character of the digitpos+=1;endwhileL=pos-occurs[p];// the length of the repetend (being < q)// mark the digits of the repetend by a vinculum:forifromoccurs[p]topos-1dosubstring(s,i,1)=overline(substring(s,i,1));endforreturn(s);endfunction

The first highlighted line calculates the digitz.

The subsequent line calculates the new remainderp′ of the divisionmodulo the denominatorq. As a consequence of thefloor functionfloor we have

bpq1<z=bpqbpq,{\displaystyle {\frac {bp}{q}}-1\;\;<\;\;z=\left\lfloor {\frac {bp}{q}}\right\rfloor \;\;\leq \;\;{\frac {bp}{q}},}

thus

bpq<zqp:=bpzq<q{\displaystyle bp-q<zq\quad \implies \quad p':=bp-zq<q}

and

zqbp0bpzq=:p.{\displaystyle zq\leq bp\quad \implies \quad 0\leq bp-zq=:p'\,.}

Because all these remaindersp are non-negative integers less thanq, there can be only a finite number of them with the consequence that they must recur in thewhile loop. Such a recurrence is detected by theassociative arrayoccurs. The new digitz is formed in the yellow line, wherep is the only non-constant. The lengthL of the repetend equals the number of the remainders (see also sectionEvery rational number is either a terminating or repeating decimal).

Table of values

[edit]
  • fraction
    decimal
    expansion
    10binary
    expansion
    2
    1/20.500.10
    1/30.310.012
    1/40.2500.010
    1/50.200.00114
    1/60.1610.0012
    1/70.14285760.0013
    1/80.12500.0010
    1/90.110.0001116
    1/100.100.000114
    1/110.0920.000101110110
    1/120.08310.00012
    1/130.07692360.00010011101112
    1/140.071428560.00013
    1/150.0610.00014
    1/160.062500.00010
  • fraction
    decimal
    expansion
    10
    1/170.058823529411764716
    1/180.051
    1/190.05263157894736842118
    1/200.050
    1/210.0476196
    1/220.0452
    1/230.043478260869565217391322
    1/240.04161
    1/250.040
    1/260.03846156
    1/270.0373
    1/280.035714286
    1/290.034482758620689655172413793128
    1/300.031
    1/310.03225806451612915
  • fraction
    decimal
    expansion
    10
    1/320.031250
    1/330.032
    1/340.0294117647058823516
    1/350.02857146
    1/360.0271
    1/370.0273
    1/380.026315789473684210518
    1/390.0256416
    1/400.0250
    1/410.024395
    1/420.02380956
    1/430.02325581395348837209321
    1/440.02272
    1/450.021
    1/460.0217391304347826086956522
    1/470.021276595744680851063829787234042553191489361746
    1/480.020831
    1/490.02040816326530612244897959183673469387755142
    1/500.020
    1/510.019607843137254916
    1/520.019230766
    1/530.018867924528313
    1/540.01853
    1/550.0182
    1/560.0178571426
    1/570.01754385964912280718
    1/580.0172413793103448275862068965528
    1/590.016949152542372881355932203389830508474576271186440677966158
    1/600.0161

Therebyfraction is theunit fraction1/n and10 is the length of the (decimal) repetend.

The lengths10(n) of the decimal repetends of1/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, 18, 6, 6, 13, 0, 9, 5, 41, 6, 16, 21, 28, 2, 44, 1, 6, 22, 15, 46, 18, 1, 96, 42, 2, 0... (sequenceA051626 in theOEIS).

For comparison, the lengths2(n) of thebinary repetends of the fractions1/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], ifn not a power of 2 else =0).

The decimal repetends of1/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, 032258064516129, 0, 03, 2941176470588235, 285714... (sequenceA036275 in theOEIS).

The decimal repetend lengths of1/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, 141, 146, 153, 155, 312, 79... (sequenceA002371 in theOEIS).

The least primesp for which1/p has decimal repetend lengthn,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, 2791, 353, 67, 103, 71, 999999000001, 2028119, 909090909090909091, 900900900900990990990991, 1676321, 83, 127, 173... (sequenceA007138 in theOEIS).

The least primesp for whichk/p hasn different cycles (1 ≤kp−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, 49663, 12289, 859, 239, 27581, 9613, 18131, 13757, 33931... (sequenceA054471 in theOEIS).

See also

[edit]

Notes

[edit]
  1. ^Courant, R. and Robbins, H.What Is Mathematics?: An Elementary Approach to Ideas and Methods, 2nd ed. Oxford, England: Oxford University Press, 1996: p. 67.
  2. ^Beswick, Kim (2004), "Why Does 0.999... = 1?: A Perennial Question and Number Sense",Australian Mathematics Teacher,60 (4):7–9
  3. ^"Lambert's Original Proof that $\pi$ is irrational".Mathematics Stack Exchange. Retrieved2023-12-19.
  4. ^Conférence Intercantonale de l'Instruction Publique de la Suisse Romande et du Tessin (2011).Aide-mémoire. Mathématiques 9-10-11. LEP. pp. 20–21.
  5. ^For a baseb and a divisorn, in terms of group theorythis length divides
    ordn(b):=min{LNbL1modn}{\displaystyle \operatorname {ord} _{n}(b):=\min\{L\in \mathbb {N} \,\mid \,b^{L}\equiv 1{\bmod {n}}\}}
    (withmodular arithmetic≡ 1 modn) which divides the Carmichael function
    λ(n):=max{ordn(b)gcd(b,n)=1}{\displaystyle \lambda (n):=\max\{\operatorname {ord} _{n}(b)\,\mid \,\gcd(b,n)=1\}}
    which again dividesEuler's totient functionφ(n).
  6. ^Vuorinen, Aapeli."Rational numbers have repeating decimal expansions".Aapeli Vuorinen. Retrieved2023-12-23.
  7. ^"The Sets of Repeating Decimals".www.sjsu.edu. Archived fromthe original on 23 December 2023. Retrieved2023-12-23.
  8. ^RoRi (2016-03-01)."Prove that every repeating decimal represents a rational number".Stumbling Robot. Archived fromthe original on 23 December 2023. Retrieved2023-12-23.
  9. ^Gray, Alexander J. (March 2000). "Digital roots and reciprocals of primes".Mathematical Gazette.84 (499): 86.doi:10.2307/3621484.JSTOR 3621484.S2CID 125834304.For primes greater than 5, all the digital roots appear to have the same value, 9. We can confirm this if...
  10. ^Dickson, L. E.,History of the Theory of Numbers, Volume 1, Chelsea Publishing Co., 1952.
  11. ^William E. Heal. Some Properties of Repetends. Annals of Mathematics, Vol. 3, No. 4 (Aug., 1887), pp. 97–103
  12. ^Albert H. Beiler,Recreations in the Theory of Numbers, p. 79
  13. ^Mitchell, Douglas W., "A nonlinear random number generator with known, long cycle length",Cryptologia 17, January 1993, pp. 55–62.
  14. ^Dickson, Leonard E.,History of the Theory of Numbers, Vol. I, Chelsea Publ. Co., 1952 (orig. 1918), pp. 164–173.
  15. ^Armstrong, N. J., and Armstrong, R. J., "Some properties of repetends",Mathematical Gazette 87, November 2003, pp. 437–443.

External links

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Repeating_decimal&oldid=1331585998"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp