Midy's Theorem

In mathematics, Midy's theorem, named after French mathematician E. Midy, is a statement about the decimal expansion of fractions ''a''/''p'' where ''p'' is a prime and ''a''/''p'' has a repeating decimal expansion with an even period . If the period of the decimal representation of ''a''/''p'' is 2''n'', so that

:$\frac=0.\overline$

then the digits in the second half of the repeating decimal period are the 9s complement of the corresponding digits in its first half. In other words,

:$a_i+a_=9$
:$a_1\dots a_n+a_\dots a_=10^n-1.$

For example,

:$\frac=0.\overline\text076+923=999.$
:$\frac=0.\overline\text05882352+94117647=99999999.$

Extended Midy's theorem

If ''k'' is any divisor of ''h'' (where ''h'' is a number of digits of the period of the decimal expansion of ''a''/''p'' (where ''p'' is again a prime)), then Midy's theorem can be generalised as follows. The extended Midy's theoremBassam Abdul-Baki
''Extended Midy's Theorem''
2005. states that if the repeating portion of the decimal expansion of ''a''/''p'' is divided into ''k''-digit numbers, then their sum is a multiple of 10^''k'' − 1.

For example,
:$\frac=0.\overline$
has a period of 18. Dividing the repeating portion into 6-digit numbers and summing them gives
:$052631+578947+368421=999999.$
Similarly, dividing the repeating portion into 3-digit numbers and summing them gives
:$052+631+578+947+368+421=2997=3\times999.$

Midy's theorem in other bases

Midy's theorem and its extension do not depend on special properties of the decimal expansion, but work equally well in any base ''b'', provided we replace 10^''k'' − 1 with ''b''^''k'' − 1 and carry out addition in base ''b''.

For example, in octal

:
\begin
& \frac=0.\overline_8 \\ pt& 032_8+745_8=777_8 \\ pt& 03_8+27_8+45_8=77_8.
\end

In duodecimal (using inverted two and three for ten and eleven, respectively)

:
\begin
& \frac=0.\overline_ \\ pt& 076_+\mathcal45_=\mathcal_ \\ pt& 07_+6\mathcal_+45_=\mathcal_
\end

Proof of Midy's theorem

Short proofs of Midy's theorem can be given using results from group theory. However, it is also possible to prove Midy's theorem using elementary algebra and modular arithmetic:

Let ''p'' be a prime and ''a''/''p'' be a fraction between 0 and 1. Suppose the expansion of ''a''/''p'' in base ''b'' has a period of ''ℓ'', so

:
\begin
& \frac = .\overlineb \\ pt& \Rightarrow\fracb^\ell = _1a_2\dots a_\ell.\overlineb \\ pt& \Rightarrow\fracb^\ell = N+ .\overlineb=N+\frac \\ pt& \Rightarrow\frac = \frac
\end

where ''N'' is the integer whose expansion in base ''b'' is the string ''a''₁''a''₂...''a''_''ℓ''.

Note that ''b'' ^''ℓ'' − 1 is a multiple of ''p'' because (''b'' ^''ℓ'' − 1)''a''/''p'' is an integer. Also ''b''^''n''−1 is ''not'' a multiple of ''p'' for any value of ''n'' less than ''ℓ'', because otherwise the repeating period of ''a''/''p'' in base ''b'' would be less than ''ℓ''.

Now suppose that ''ℓ'' = ''hk''. Then ''b'' ^''ℓ'' − 1 is a multiple of ''b''^''k'' − 1. (To see this, substitute ''x'' for ''b''^''k''; then ''b''^''ℓ'' = ''x''^''h'' and ''x'' − 1 is a factor of ''x''^''h'' − 1. ) Say ''b'' ^''ℓ'' − 1 = ''m''(''b''^''k'' − 1), so

:$\frac=\frac.$

But ''b'' ^''ℓ'' − 1 is a multiple of ''p''; ''b''^''k'' − 1 is ''not'' a multiple of ''p'' (because ''k'' is less than ''ℓ'' ); and ''p'' is a prime; so ''m'' must be a multiple of ''p'' and

:$\frac=\frac$

is an integer. In other words,

:$N\equiv0\pmod.$

Now split the string ''a''₁''a''₂...''a''_''ℓ'' into ''h'' equal parts of length ''k'', and let these represent the integers ''N''₀...''N''_{''h'' − 1} in base ''b'', so that

:
\begin
N_ & = _1\dots a_kb \\
N_ & = _\dots a_b \\
& \ \ \vdots \\
N_0 & = _\dots a_lb
\end

To prove Midy's extended theorem in base ''b'' we must show that the sum of the ''h'' integers ''N''_''i'' is a multiple of ''b''^''k'' − 1.

Since ''b''^''k'' is congruent to 1 modulo ''b''^''k'' − 1, any power of ''b''^''k'' will also be congruent to 1 modulo ''b''^''k'' − 1. So

:$N=\sum_^N_ib^=\sum_^N_i(b^)^i$
:$\Rightarrow N \equiv \sum_^N_i \pmod$
:$\Rightarrow \sum_^N_i \equiv 0 \pmod$

which proves Midy's extended theorem in base ''b''.

To prove the original Midy's theorem, take the special case where ''h'' = 2. Note that ''N''₀ and ''N''₁ are both represented by strings of ''k'' digits in base ''b'' so both satisfy

:$0 \leq N_i \leq b^k-1.$

''N''₀ and ''N''₁ cannot both equal 0 (otherwise ''a''/''p'' = 0) and cannot both equal ''b''^''k'' − 1 (otherwise ''a''/''p'' = 1), so

:$0 < N_0+N_1 < 2(b^k-1)$

and since ''N''₀ + ''N''₁ is a multiple of ''b''^''k'' − 1, it follows that

:$N_0+N_1 = b^k-1.$

Corollary

From the above,
:$\frac$ is an integer

Thus $m \equiv 0 \pmod p$

And thus for $k = \frac$

:$b^+ 1 \equiv 0 \pmod p$

For $k = \frac$ and is an integer

:$b^ + b^ + 1 \equiv 0 \pmod p$

and so on.

Notes

References

*Rademacher, H. and Toeplitz, O. ''The Enjoyment of Mathematics: Selections from Mathematics for the Amateur''. Princeton, NJ: Princeton University Press, pp. 158–160, 1957.
*E. Midy, "De Quelques Propriétés des Nombres et des Fractions Décimales Périodiques". College of Nantes, France: 1836.
* Ross, Kenneth A. "Repeating decimals: a period piece". ''Math. Mag.'' 83 (2010), no. 1, 33–45.

External links

* {{MathWorld, urlname=MidysTheorem, title=Midy's Theorem

Theorems in number theory
Fractions (mathematics)
Numeral systems