Difference between revisions of "2018 AMC 10A Problems/Problem 18"

(Solution)
(Solution 2)
Line 17: Line 17:
  
 
Note that all numbers formed from this sum are either positive, negative or zero. The number of positive numbers formed by this sum is equal to the number of negative numbers formed by this sum, because of symmetry. There is only one way to achieve a sum of zero, if all <math>a_i=0</math>. The total number of ways to pick <math>a_i</math> from <math>i=1, 2, 3, ... 7</math> is <math>3^8=6561</math>. <math>\frac{6561-1}{2}=3280</math> gives the number of possible negative integers. The question asks for the number of nonnegative integers, so subtracting from the total gives <math>6561-3280=\boxed{3281}</math>.
 
Note that all numbers formed from this sum are either positive, negative or zero. The number of positive numbers formed by this sum is equal to the number of negative numbers formed by this sum, because of symmetry. There is only one way to achieve a sum of zero, if all <math>a_i=0</math>. The total number of ways to pick <math>a_i</math> from <math>i=1, 2, 3, ... 7</math> is <math>3^8=6561</math>. <math>\frac{6561-1}{2}=3280</math> gives the number of possible negative integers. The question asks for the number of nonnegative integers, so subtracting from the total gives <math>6561-3280=\boxed{3281}</math>.
 +
 +
~RegularHexagon

Revision as of 18:25, 8 February 2018

How many nonnegative integers can be written in the form \[a_7\cdot3^7+a_6\cdot3^6+a_5\cdot3^5+a_4\cdot3^4+a_3\cdot3^3+a_2\cdot3^2+a_1\cdot3^1+a_0\cdot3^0,\] where $a_i\in \{-1,0,1\}$ for $0\le i \le 7$?

$\textbf{(A) } 512 \qquad  \textbf{(B) } 729 \qquad  \textbf{(C) } 1094 \qquad  \textbf{(D) } 3281 \qquad  \textbf{(E) } 59,048$

Solution

This looks like balanced ternary, in which all the integers with absolute values less than $\frac{3^n}{2}$ are represented in $n$ digits. There are 8 digits. Plugging in 8 into the formula gives a maximum bound of $|x|=3280.5$, which means there are 3280 positive integers, 0, and 3280 negative integers. Since we want all nonnegative integers, there are $3280+1=\boxed{3281}$ integers or $\boxed{D}$.

$QED\blacksquare$

Solution 2

Note that all numbers formed from this sum are either positive, negative or zero. The number of positive numbers formed by this sum is equal to the number of negative numbers formed by this sum, because of symmetry. There is only one way to achieve a sum of zero, if all $a_i=0$. The total number of ways to pick $a_i$ from $i=1, 2, 3, ... 7$ is $3^8=6561$. $\frac{6561-1}{2}=3280$ gives the number of possible negative integers. The question asks for the number of nonnegative integers, so subtracting from the total gives $6561-3280=\boxed{3281}$.

~RegularHexagon