Lesson What is the length of the repeating part in the decimal form of the fraction 1/937 ?

Algebra ->  Divisibility and Prime Numbers  -> Lessons -> Lesson What is the length of the repeating part in the decimal form of the fraction 1/937 ?      Log On


   


This Lesson (What is the length of the repeating part in the decimal form of the fraction 1/937 ?) was created by by ikleyn(54018) About Me : View Source, Show
About ikleyn:

What is the length of the repeating part of the decimal form of the fraction 1/937?


Problem 1

In the decimal form, the fraction 1/937 has a repeating part.
What is the length of this repeating part?

Solution

        In this lesson, I will prove that the number 1/937
        has a repeating sequence of decimal digits of length 936.


Let 'a' be the ratio 1/937

    a = 1%2F937.


Notice that 937 is a prime number. It is neither of the form 2%5Ek nor 5%5Ek, where 'k' is an integer.

Therefore, from the general theory, 1/937, as a decimal, has the form 

    a = 1%2F937 = 0.RPPPPP...,

where R is some unique sequence of digits of length 'r,' and P is the repeating sequence of digits of length 'p'.


    +------------------------------------------------+
    |   We consider here 'p' as the minimal length.  |
    +------------------------------------------------+


Therefore, 

    10%5Er%2Aa is the decimal number of the form R.PPPPP...    (1)

while 

    10%5Er%2A10%5Ep%2Aa is the decimal number of the form RP.PPPPP...    (2)


Notice that the decimal parts of these two numbers, (1) and (2), are identical 0.PPPP...


Therefore, the difference between numbers (1) and (2) is an integer number N

    10%5E%28r%2Bp%29%2Aa - 10%5Er%2Aa = 10%5Er%2A%2810%5Ep-1%29%2Aa = N,    (3)

because taking the difference kills the identical decimal parts.


We can rewrite equation (3) in the form

    10%5Er%2A%2810%5Ep-1%29%2A%281%2F937%29 = N,

or, equivalently,

    10%5Er%2A%2810%5Ep-1%29 = 937*N.    (4)


It tells us that the left side, 10%5Er%2A%2810%5Ep-1%29, is divisible by the prime number 937.


But since 10 is coprime to 937, we conclude from this that 10%5Ep-1 is divisible by the prime number 937.


According to Fermat's Little Theorem, this implies that p = 936.


Thus, this proves that the repeating sequence of decimal digits of 1%2F937 has length 936.

So, the statement formulated at the beginning of my post is proved.

As you see, the proof is elementary, but inexpressibly elegant.

It is a classic statement and a classic proof of number theory.


My other lessons in this site on miscellaneous problems on divisibility of integer numbers are
    - Light flashes on a Christmas tree and a Least Common Multiple
    - The number that leaves a remainder 1 when divided by 2, by 3, by 4, by 5 and so on until 9
    - The number which gives remainder 4 when divided by 7, remainder 5 when divided by 8 and remainder 6 when divided by 9
    - Introductory problems on divisibility of integer numbers
    - Finding Greatest Common Divisor of integer numbers
    - Relatively prime numbers help to solve the problem
    - Solving equations in integer numbers
    - Quadratic polynomial with odd integer coefficients can not have a rational root
    - Proving an equation has no integer solutions
    - Composite number of the form (4n+3) must have a prime divisor of the form (4n+3)
    - Problems on divisors of a given number
    - How many three-digit numbers are multiples of both 5 and 7?
    - How many 3-digit numbers are not divisible by 2; not divisible by 3; not divisible by either 2 or 3
    - How many integer numbers in the range 1-300 are divisible by at least one of the integers 4, 6 and 15 ?
    - Find the remainder of division
    - Why 3^n + 7^n - 2 is divisible by 8 for all positive integer n ?
    - What is the last digit of the number a^n ?
    - Find the last three digits of these numbers
    - Find the last two digits of the number 3^123 + 7^123 + 9^123
    - Find the last two digits of (1! + 2! + 3! + ... + 2024!)^2024
    - Find n-th term of a sequence
    - Solving Diophantine equations
    - How many integers of the form n^2 + 18n + 13 are perfect squares
    - Miscellaneous problems on divisibility numbers
    - Find the sum of digits of integer numbers
    - Two-digit numbers with digit "9"
    - Find a triangle with integer side lengths and integer area
    - Math Circle level problem on lockers and divisors of integer numbers
    - Nice entertainment problems related to divisibility properties
    - Solving problems on modular arithmetic
    - Using the little Fermat's theorem to solve a problem on modular arithmetic
    - OVERVIEW of miscellaneous solved problems on divisibility of integer numbers



This lesson has been accessed 96 times.