New Year's Countdown Day 2: Two to 2x

Let N N be a positive integer such that 2 N 2N is equal to the integer formed by moving the last two digits of N N to the front of the number. The smallest possible value of N N has n n digits and leaves a remainder of k k when divided by 1000. Find the value of n k . nk.

Details and Assumptions:

  • When we move the last two digits to the front, we keep the order in which the digits were in. For example, moving the last two digits of 2017 2017 to the front gives us 1720. 1720.
  • Both N N and 2 N 2N cannot have any leading zeroes.

This problem is part of the set New Year's Countdown 2017 .


The answer is 1980.

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

Steven Yuan
Dec 2, 2017

Let N = a n a n 1 a n 2 a 2 a 1 , N = \overline{a_n a_{n - 1} a_{n - 2} \dots a_2 a_1}, where all the a i a_i s are digits such that a n , a 2 0 a_n, a_2 \neq 0 (to avoid leading zeroes). We want to find the smallest value of N N such that

2 a n a n 1 a n 2 a 2 a 1 = a 2 a 1 a n a 4 a 3 . 2 \overline{a_n a_{n - 1} a_{n - 2} \dots a_2 a_1} = \overline{a_2 a_1 a_n \dots a_4 a_3}.

Let A = a n a n 1 a 4 a 3 A = \overline{a_n a_{n - 1} \dots a_4 a_3} and B = a 2 a 1 . B = \overline{a_2 a_1}. The condition rewrites and simplifies into

2 ( 100 A + B ) = 1 0 n 2 B + A 199 A = ( 1 0 n 2 2 ) B . \begin{aligned} 2(100A + B) &= 10^{n - 2}B + A \\ 199A &= (10^{n - 2} - 2)B. \end{aligned}

The right hand side of the equation must be divisible by 199. Since 199 is prime, we must have either 199 1 0 n 2 2 199|10^{n - 2} - 2 or 199 B . 199|B. As B B has two digits, it cannot be divisible by a three-digit number, so it must be true that 199 1 0 n 2 2. 199|10^{n - 2} - 2. Writing this in modulo notation yields

1 0 n 2 2 0 ( m o d 199 ) 1 0 n 2 2 ( m o d 199 ) 100 ( 1 0 n 2 ) 100 2 ( m o d 199 ) 1 0 n = 1 ( m o d 199 ) . \begin{aligned} 10^{n - 2} - 2 &\equiv 0 \! \! \! \! \pmod{199} \\ 10^{n - 2} &\equiv 2 \! \! \! \! \pmod{199} \\ 100(10^{n - 2}) &\equiv 100 \cdot 2 \! \! \! \! \pmod{199} \\ 10^n &= 1 \! \! \! \! \pmod{199}. \end{aligned}

Since we wish to minimize N , N, we want the smallest value of n n for which this is true. But that is precisely equal to ord 199 ( 10 ) , \text{ord}_{199}(10), which we can calculate to be n = 99. n = 99. Thus, N N has 99 digits, while A A has 97 digits.

Plugging this value of n n back into our original condition yields

199 A = ( 1 0 97 2 ) B A = 1 0 97 2 199 B . \begin{aligned} 199A &= (10^{97} - 2)B \\ A &= \dfrac{10^{97} - 2}{199}B. \end{aligned}

The number 1 0 97 2 199 \dfrac{10^{97} - 2}{199} has log 10 ( 1 0 97 2 199 ) + 1 = 95 \left \lfloor \log_{10} \left ( \dfrac{10^{97} - 2}{199} \right) + 1\right \rfloor = 95 digits, so we seek the smallest value of B B that will make A A have 97 digits. By inspection, the minimum such value of B B is 20, giving us A = 20 ( 1 0 97 2 ) 199 A = \dfrac{20(10^{97} - 2)}{199} and N = 20 ( 1 0 97 2 ) 199 1 0 2 + 20 = 20 ( 1 0 99 1 ) 199 . N = \dfrac{20(10^{97} - 2)}{199} \cdot 10^2 + 20 = \dfrac{20(10^{99} - 1)}{199}.

To find the value of k , k, we find the last three digits of the value of N N we just found. The last two digits are B = 20. B = 20. The hundreds place is the units digit of A , A, which is 0 because of the factor of 20 in its value. Thus, the last three digits of N N are k = 020 = 20. k = 020 = 20.

Our final answer is n k = 99 ( 20 ) = 1980 . nk = 99(20) = \boxed{1980}. The value of N N written out in full is

N = 100 , 502 , 512 , 562 , 814 , 070 , 351 , 758 , 793 , 969 , 849 , 246 , 231 , 155 , 778 , 894 , 472 , 361 , 809 , 045 , 226 , 130 , 653 , 266 , 331 , 658 , 291 , 457 , 286 , 432 , 160 , 804 , 020. N = 100,502,512,562,814,070,351,758,793,969,849, \\ \quad 246,231,155,778,894,472,361,809,045,226,130, \\ \quad 653,266,331,658,291,457,286,432,160,804,020.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...