Skip to main content

2014 AMC 12A Problem 23

Problem 23 of 25HarderNumber TheoryArithmeticProblem-Solving Techniques

The fraction 1992=0.bn−1bn−2…b2b1b0‾,\dfrac{1}{99^2}=0.\overline{b_{n-1}b_{n-2}\ldots b_2b_1b_0}, where nn is the length of the period of the repeating decimal expansion. What is the sum b0+b1+⋯+bn−1?b_0+b_1+\cdots+b_{n-1}?

Answer choices

Show solution

Solution

Reading the block in pairs of digits (base 100100), 19801=1992\dfrac{1}{9801}=\dfrac{1}{99^2} expands as 00,01,02,…,00,01,02,\ldots, since 1(100−1)2=∑k≥1k⋅100−k.\dfrac{1}{(100-1)^2}=\sum_{k\ge1}k\cdot100^{-k}. Let aja_j be the jjth base-100100 digit of the repeating block. Multiplying the block by 99299^2 shows first that a0=99.a_0=99. The resulting carry gives a1=97,a_1=97, after which there is no carry and successively aj=98−ja_j=98-j for 1≤j≤98.1\le j\le98. The next digit is again 99,99, so the period is 00,01,02,…,96,97,99,00,01,02,\ldots,96,97,99, with 9898 omitted. If the blocks 0000 through 9999 all appeared, the digit sum would be (0+1+⋯+9)⋅20=900.(0+1+\cdots+9)\cdot20=900. Removing the missing 9898 subtracts 9+8,9+8, giving 900−9−8=883.900-9-8=883. Thus, the correct answer is B.
AoPS wiki

Tagged: repeating decimal · digits · pattern recognition

More practice