Skip to main content

2018 AMC 10A Problem 18

Problem 18 of 25IntermediateArithmeticProblem-Solving Techniques

How many nonnegative integers can be written in the form a7⋅37+a6⋅36+a5⋅35a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a4⋅34+a3⋅33+a2⋅32+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a1⋅31+a0⋅30,+a_1\cdot3^1+a_0\cdot3^0, where ai∈{−1,0,1}a_i\in \{-1,0,1\} for 0≤i≤7?0\le i \le 7?

Answer choices

Show solution

Solution

Note that every number formed by this sum is either positive, negative, or zero. The number of positive numbers equals the number of negative numbers due to symmetry (flip the 11 s to −1-1 s and −1-1 s to 11 s). The only way for the sum to be 00 is if all the coefficients are 0.0. The total number of numbers is 38=6561.3^8 = 6561. Because each power of 33 is larger than the sum of all previous powers of three, each combination of coefficients yields a different value. More explicitly, at the highest place where two combinations differ, the difference has magnitude at least 3k,3^k, while all lower places together can cancel at most 2(1+3+⋯+3k−1)=3k−1.2(1+3+\cdots+3^{k-1})=3^k-1. Therefore, there are 6561−12+1=3281 \dfrac{6561 - 1}{2} + 1 = 3281 distinct nonnegative integers. Thus, D is the correct answer.
AoPS wiki

Tagged: number base · symmetry · pairing and grouping

More practice