2014 AMC 12A Problem 23

Below is the professionally curated solution for Problem 23 of the 2014 AMC 12A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2014 AMC 12A solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:repeating decimaldigitspattern recognition

Difficulty rating: 2380

23.

The fraction 1992=0.bn1bn2b2b1b0,\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++bn1?b_0+b_1+\cdots+b_{n-1}?

874874

883883

887887

891891

892892

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(1001)2=k1k100k.\dfrac{1}{(100-1)^2}=\sum_{k\ge1}k\cdot100^{-k}. Carrying works out so that every two-digit block 00,01,,9700,01,\ldots,97 appears, the block 9898 is skipped, and 9999 appears, before the period repeats.

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 90098=883.900-9-8=883.

Thus, the correct answer is B.

Problem 23 in Other Years