Which is longer?

We see that the fractional part of 1 3 \frac{1}{3} is 0.333... It repeats after one digit. Let us say that 1 3 \frac{1}{3} has "period" one. We can also say that 1 7 = 0.142857142857142857... \frac{1}{7} = 0.142857142857142857... has "period' six. Which of the following has the longest "period'?

1 23 \frac{1}{23} 1 17 \frac{1}{17} 1 19 \frac{1}{19} 1 11 \frac{1}{11}

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Lixin Zheng
May 13, 2017

Fermat's little theorem states that if a a is not divisible by p p , then a p 1 1 ( m o d p ) a^{p-1}\equiv 1 \pmod{p} . The period, k k of a fraction, 1 q \dfrac1{q} , can be modeled as 1 0 k 1 ( m o d q ) 10^{k}\equiv 1 \pmod{q} . This means that we are looking for a number k k , such that 1 0 k 1 ( m o d q ) 10^{k}\equiv 1 \pmod{q} . Applying Fermat's little theorem and noticing that 10 is coprime to all of these denominators, we obtain that k k is 1 less than each of the denominators. Thus k k is the biggest for the fraction 1 23 \boxed{\frac{1}{23}}

I'm not sure that solution is fully correct, considering that it implies 1/11 has a period of 10, when it actually has a period of 2.

Tyler Friedman - 4 years ago

Log in to reply

Thanks for pointing that out, however, it has a period of two because 10^2 is congruent to 1 mod 11, so in this case, 2 would be the smallest number that satisfies 10^k is congruent to 1 mod 11.

Lixin Zheng - 4 years ago

Your argument is wrong. 1/37 has a period length of 3 and it is coprime to 10.

Stephan Hensel - 3 years, 1 month ago

7 is not divisible by 3, but 7^(3-1) = 2 (mod 3), what did I get wrong about Fermat's little theorem?

Johannes H - 2 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...