Instant trick

Definition : A natural number ( 1 ) k (1)^k , for natural number k 1 k \geq 1 , is defined as below.

( 1 ) k = i = 0 k 1 1 0 i (1)^k = \sum_{i=0}^{k-1}10^i

Fact: For any prime p 2 , 5 p\neq 2,5 there exist a k k , such that p p divides ( 1 ) k (1)^k .

Question: What is the smallest k k , for which 9901 9901 divides ( 1 ) k (1)^k ?

Tool: A basic arithmetic calculator, that can calculate up to 100 decimal points. The calculator can be used only for one operation and it would lock automatically after a single operation.

Expectation: Please do not try dividing numbers of form ( 1 ) k (1)^k by 9901 9901 , using a calculator, until you get the solution :)


The answer is 12.

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.

3 solutions

Mark Hennings
Jul 11, 2018

Note that 9901 = 99 × 100 + 1 = 10 0 2 100 + 1 = 1 0 4 1 0 2 + 1 9901 = 99\times100 + 1 = 100^2 - 100 + 1 \; = \; 10^4 - 10^2 + 1 , so that 101 × 9901 = ( 1 0 2 + 1 ) ( 1 0 4 1 0 2 + 1 ) = 1 0 6 + 1 101 \times 9901 \; = \; (10^2 + 1)(10^4 - 10^2 + 1) \; = \; 10^6 + 1 and hence 9901 9901 divides 1 0 12 1 = 9 × ( 1 ) 12 10^{12}-1 = 9 \times (1)^{12} .

If k k is the smallest positive integer such that 9901 9901 divides ( 1 ) k = 1 9 ( 1 0 k 1 ) (1)^k = \tfrac19(10^k - 1) , then k k is the smallest positive integer such that 1 0 k 1 ( m o d 9901 ) 10^k \equiv 1 \pmod{9901} , and hence k k divides 12 12 . But 1 0 6 1 ( m o d 9901 ) 10^6 \equiv -1 \pmod{9901} and 1 0 4 99 ( m o d 9901 ) 10^4 \equiv 99 \pmod{9901} (see the identities in the first paragraph, while 10 , 1 0 2 , 1 0 3 10,10^2,10^3 are all smaller than 9901 9901 . Thus we deduce that the required answer is 12 \boxed{12} .

wow, people like you here

A Former Brilliant Member - 2 years, 10 months ago

All one needs to do is to divide 1 1 by 9901 9901 in the calculator. The fraction is rational and it is of the repeating decimal part type. The number of decimal points, before the repeating starts, would be the answer.

To understand the mechanics, one should know that 0. a n 1 . . . a 0 = a n 1 . . . a 0 9 × ( 1 ) n = A B 0.\overline{a_{n-1}...a_0}=\frac{\overline{a_{n-1}...a_0}}{9 \times (1)^n}=\frac{A}{B} , where g c d ( A , B ) = 1 gcd(A,B)=1 .

Then, there exists k N k \in \mathbb{N}

1 9901 = 0. a k 1 . . . a 0 = a k 1 . . . a 0 9 × ( 1 ) k 9901 × a n 1 . . . a 0 = 9 × ( 1 ) k 9901 ( 1 ) k \frac{1}{9901}=0.\overline{a_{k-1}...a_0}=\frac{\overline{a_{k-1}...a_0}}{9 \times (1)^k} \implies 9901\times \overline{a_{n-1}...a_0}=9 \times (1)^k \implies 9901 | (1)^k

and, clearly, k k is the number of the decimals of 0. a k 1 . . . a 0 0.\overline{a_{k-1}...a_0} .

Fahim Saikat
Dec 17, 2018

calculate 1/9901 in the calculator and find the length of the repeating units after decimal.

MIT student, right? You may receive a Field Medal for this.

A Former Brilliant Member - 2 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...