词条 | Midy's theorem |
释义 |
In mathematics, Midy's theorem, named after French mathematician E. Midy,[1][2] 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 {{OEIS|id=A028416}}. If the period of the decimal representation of a/p is 2n, so that 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, For example, Extended Midy's theoremIf k is any divisor 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 theorem[3] 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 10k − 1. For example, has a period of 18. Dividing the repeating portion into 6-digit numbers and summing them gives Similarly, dividing the repeating portion into 3-digit numbers and summing them gives Midy's theorem in other basesMidy'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 10k − 1 with bk − 1 and carry out addition in base b. For example, in octal In duodecimal (using inverted two and three for ten and eleven, respectively) Proof of Midy's theoremShort 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 where N is the integer whose expansion in base b is the string a1a2...aℓ. Note that b ℓ − 1 is a multiple of p because (b ℓ − 1)a/p is an integer. Also bn−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 bk − 1. (To see this, substitute x for bk; then bℓ = xh and x − 1 is a factor of xh − 1. ) Say b ℓ − 1 = m(bk − 1), so But b ℓ − 1 is a multiple of p; bk − 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 is an integer. In other words, Now split the string a1a2...aℓ into h equal parts of length k, and let these represent the integers N0...Nh − 1 in base b, so that To prove Midy's extended theorem in base b we must show that the sum of the h integers Ni is a multiple of bk − 1. Since bk is congruent to 1 modulo bk − 1, any power of bk will also be congruent to 1 modulo bk − 1. So 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 N0 and N1 are both represented by strings of k digits in base b so both satisfy N0 and N1 cannot both equal 0 (otherwise a/p = 0) and cannot both equal bk − 1 (otherwise a/p = 1), so and since N0 + N1 is a multiple of bk − 1, it follows that CorollaryFrom the above, is an integer Thus And thus for For and is an integer and so on. Notes1. ^{{cite journal|last=Leavitt|first=William G.|title=A Theorem on Repeating Decimals|journal=The American Mathematical Monthly|date=June 1967|volume=74|issue=6|pages=669–673|url=http://digitalcommons.unl.edu/mathfacpub/48/|publisher=Mathematical Association of America|doi=10.2307/2314251}} 2. ^{{cite web|last=Kemeny|first=John|title=The Secret Theorem of M. E. Midy = Casting In Nines|url=http://johnkemeny.com/blog/?p=393|accessdate=27 November 2011}} 3. ^Bassam Abdul-Baki, Extended Midy's Theorem, 2005. References
External links
3 : Theorems in number theory|Fractions (mathematics)|Numeral systems |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。