Difference between revisions of "2018 AMC 10A Problems/Problem 18"
Line 11: | Line 11: | ||
==Solution 1== | ==Solution 1== | ||
− | This looks like balanced ternary, in which all the integers with absolute values less than <math>\frac{3^n}{2}</math> are represented in <math>n</math> digits. There are 8 digits. Plugging in 8 into the formula for the balanced ternary gives a maximum bound of <math>|x|=3280.5</math>, which means there are 3280 positive integers, 0, and 3280 negative integers. Since we want all nonnegative integers, there are <math>3280+1=\boxed{3281}</math> integers or \boxed{\textbf{D}}<math>. | + | This looks like balanced ternary, in which all the integers with absolute values less than <math>\frac{3^n}{2}</math> are represented in <math>n</math> digits. There are 8 digits. Plugging in 8 into the formula for the balanced ternary gives a maximum bound of <math>|x|=3280.5</math>, which means there are 3280 positive integers, 0, and 3280 negative integers. Since we want all nonnegative integers, there are <math>3280+1=\boxed{3281}</math> integers or <math>\boxed{\textbf{D}}</math>. |
==Solution 2== | ==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 < | + | 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=0, 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 non-negative integers, so subtracting from the total gives <math>6561-3280=\boxed{\textbf{(D) } 3281}</math>. (RegularHexagon, KLBBC minor changes) |
==Solution 3== | ==Solution 3== | ||
− | Note that the number of total possibilities (ignoring the conditions set by the problem) is < | + | Note that the number of total possibilities (ignoring the conditions set by the problem) is <math>3^8=6561</math>. So, E is clearly unrealistic. |
− | Note that if < | + | Note that if <math>a_7</math> is 1, then it's impossible for <cmath>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,</cmath> to be negative. Therefore, if <math>a_7</math> is 1, there are <math>3^7=2187</math> possibilities. (We also must convince ourselves that these <math>2187</math> different sets of coefficients must necessarily yield <math>2187</math> different integer results.) |
− | As A, B, and C are all less than 2187, the answer must be < | + | As A, B, and C are all less than 2187, the answer must be <math>\boxed{\textbf{(D) } 3281} |
==Solution 4== | ==Solution 4== | ||
Note that we can do some simple casework: | Note that we can do some simple casework: | ||
− | If <math>a_7=1< | + | If </math>a_7=1<math>, then we can choose anything for the other 7 variables, so this give us </math>3^7<math>. |
− | If <math>a_7=0< | + | If </math>a_7=0<math> and </math>a_6=1<math>, then we can choose anything for the other 6 variables, giving us </math>3^6<math>. |
− | If <math>a_7=0< | + | If </math>a_7=0<math>, </math>a_6=0<math>, and </math>a_5=1<math>, then we have </math>3^5<math>. |
− | Continuing in this vein, we have <math>3^7+3^6+\cdots+3^1+3^0< | + | Continuing in this vein, we have </math>3^7+3^6+\cdots+3^1+3^0<math> ways to choose the variables' values, except we have to add 1 |
− | because we haven't counted the case where all variables are 0. So our total sum is <math>\boxed{(D) 3281}< | + | because we haven't counted the case where all variables are 0. So our total sum is </math>\boxed{(D) 3281}<math>. |
Note that we have counted all possibilities, because the largest positive positive power of 3 must be greater than or equal to the largest negative positive power of 3, for the number to be nonnegative. | Note that we have counted all possibilities, because the largest positive positive power of 3 must be greater than or equal to the largest negative positive power of 3, for the number to be nonnegative. | ||
==Solution 5== | ==Solution 5== | ||
− | The key is to realize that this question is basically taking place in <math>a\in\{0,1,2\}< | + | The key is to realize that this question is basically taking place in </math>a\in\{0,1,2\}<math> if each value of </math>a<math> was increased by </math>1<math>, essentially making it into base </math>3<math>. Then the range would be from </math>0\cdot3^7+<math> </math>0\cdot3^6+<math> </math>0\cdot3^5+<math> </math>0\cdot3^4+<math> </math>0\cdot3^3+<math> </math>0\cdot3^2+<math> </math>0\cdot3^1+<math> </math>0\cdot3^0=<math> </math>0<math> to </math>2\cdot3^7+<math> </math>2\cdot3^6+<math> </math>2\cdot3^5+<math> </math>2\cdot3^4+<math> </math>2\cdot3^3+<math> </math>2\cdot3^2+<math> </math>2\cdot3^1+<math> </math>2\cdot3^0=<math> </math>3^8-1=<math> </math>6561-1=<math> </math>6560<math>, yielding </math>6561<math> different values. Since the distribution for all </math>a_i\in \{-1,0,1\}<math> the question originally gave is symmetrical, we retain the </math>3280<math> positive integers and one </math>0<math> but discard the </math>3280<math> negative integers. Thus, we are left with the answer, </math>\boxed{\textbf{(D)} 3281}\qquad<math>. --anna0kear |
==Solution 6== | ==Solution 6== | ||
− | First, set <math>a_i=0< | + | First, set </math>a_i=0<math> for all </math>i\geq1<math>. The range would be the integers for which </math>[-1,1]<math>. If </math>a_i=0<math> for all </math>i\geq2<math>, our set expands to include all integers such that </math>-4\leq\mathbb{Z}\leq4<math>. Similarly, when </math>i\geq3<math> we get </math>-13\leq\mathbb{Z}\leq13<math>, and when </math>i\geq4<math> the range is </math>-40\leq\mathbb{Z}\leq40<math>. The pattern continues until we reach </math>i=7<math>, where </math>-3280\leq\mathbb{Z}\leq3280<math>. Because we are only looking for positive integers, we filter out all </math>\mathbb{Z}<0<math>, leaving us with all integers between </math>0\leq\mathbb{Z}\leq3280<math>, inclusive. The answer becomes </math>\boxed{\textbf{(D) } 3281}<math>. --anna0kear |
==Solution 7== | ==Solution 7== | ||
To get the number of integers, we can get the highest positive integer that can be represented using <cmath>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,</cmath> | To get the number of integers, we can get the highest positive integer that can be represented using <cmath>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,</cmath> | ||
− | where <math>a_i\in \{-1,0,1\}< | + | where </math>a_i\in \{-1,0,1\}<math> for </math>0\le i \le 7<math>. |
− | Note that the least nonnegative integer that can be represented is <math>0< | + | Note that the least nonnegative integer that can be represented is </math>0<math>, when all </math>a_i=0<math>. The highest number will be the number when all </math>a_i=1<math>. That will be <cmath>3^7+3^6+3^5+3^4+3^3+3^2+3^1+3^0=\frac{3^8-1}{3-1}</cmath> <cmath>=3280</cmath> |
− | Therefore, there are <math>3280< | + | Therefore, there are </math>3280<math> positive integers and </math>(3280+1)<math> nonnegative integers (while including </math>0<math>) that can be represented. Our answer is </math>\boxed{\textbf{(D) } 3281}<math> |
~OlutosinNGA | ~OlutosinNGA | ||
==Solution 8== | ==Solution 8== | ||
− | Notice that there are <math>3^8< | + | Notice that there are </math>3^8<math> options for </math>a_7, a_6, \cdots a_0<math> since each </math>a_i<math> can take the value of </math>-1<math> or </math>0<math> or </math>1<math>. Now we want to find how many of them are positive and then we can add one in the end to account for </math>0<math>(they are asking for non-negative). |
− | By symmetry(look out for these on the contest), we see that exactly half of them are positive. So <math>\lfloor{\tfrac{3^8}{2}}\rfloor = 3280.< | + | By symmetry(look out for these on the contest), we see that exactly half of them are positive. So </math>\lfloor{\tfrac{3^8}{2}}\rfloor = 3280.<math> So now we will add </math>1<math> because of the </math>0<math> to account for the non-negative solutions. |
− | So our final answer is <math>3280 + 1 = 3281< | + | So our final answer is </math>3280 + 1 = 3281<math> which is </math>\boxed{\textbf{(D) } 3281}$. |
==Video Solution== | ==Video Solution== |
Revision as of 16:33, 30 December 2020
Problem
How many nonnegative integers can be written in the form
where
for
?
Solution 1
This looks like balanced ternary, in which all the integers with absolute values less than are represented in
digits. There are 8 digits. Plugging in 8 into the formula for the balanced ternary gives a maximum bound of
, which means there are 3280 positive integers, 0, and 3280 negative integers. Since we want all nonnegative integers, there are
integers or
.
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 . The total number of ways to pick
from
is
.
gives the number of possible negative integers. The question asks for the number of non-negative integers, so subtracting from the total gives
. (RegularHexagon, KLBBC minor changes)
Solution 3
Note that the number of total possibilities (ignoring the conditions set by the problem) is . So, E is clearly unrealistic.
Note that if is 1, then it's impossible for
to be negative. Therefore, if
is 1, there are
possibilities. (We also must convince ourselves that these
different sets of coefficients must necessarily yield
different integer results.)
As A, B, and C are all less than 2187, the answer must be $\boxed{\textbf{(D) } 3281}
==Solution 4==
Note that we can do some simple casework:
If$ (Error compiling LaTeX. Unknown error_msg)a_7=13^7
a_7=0
a_6=1
3^6
a_7=0
a_6=0
a_5=1
3^5
3^7+3^6+\cdots+3^1+3^0
\boxed{(D) 3281}$.
Note that we have counted all possibilities, because the largest positive positive power of 3 must be greater than or equal to the largest negative positive power of 3, for the number to be nonnegative.
==Solution 5==
The key is to realize that this question is basically taking place in$ (Error compiling LaTeX. Unknown error_msg)a\in\{0,1,2\}a
1
3
0\cdot3^7+$$ (Error compiling LaTeX. Unknown error_msg)0\cdot3^6+$$ (Error compiling LaTeX. Unknown error_msg)0\cdot3^5+$$ (Error compiling LaTeX. Unknown error_msg)0\cdot3^4+$$ (Error compiling LaTeX. Unknown error_msg)0\cdot3^3+$$ (Error compiling LaTeX. Unknown error_msg)0\cdot3^2+$$ (Error compiling LaTeX. Unknown error_msg)0\cdot3^1+$$ (Error compiling LaTeX. Unknown error_msg)0\cdot3^0=$$ (Error compiling LaTeX. Unknown error_msg)0
2\cdot3^7+$$ (Error compiling LaTeX. Unknown error_msg)2\cdot3^6+$$ (Error compiling LaTeX. Unknown error_msg)2\cdot3^5+$$ (Error compiling LaTeX. Unknown error_msg)2\cdot3^4+$$ (Error compiling LaTeX. Unknown error_msg)2\cdot3^3+$$ (Error compiling LaTeX. Unknown error_msg)2\cdot3^2+$$ (Error compiling LaTeX. Unknown error_msg)2\cdot3^1+$$ (Error compiling LaTeX. Unknown error_msg)2\cdot3^0=$$ (Error compiling LaTeX. Unknown error_msg)3^8-1=$$ (Error compiling LaTeX. Unknown error_msg)6561-1=$$ (Error compiling LaTeX. Unknown error_msg)6560
6561
a_i\in \{-1,0,1\}
3280
0
3280
\boxed{\textbf{(D)} 3281}\qquad$. --anna0kear
==Solution 6==
First, set$ (Error compiling LaTeX. Unknown error_msg)a_i=0i\geq1
[-1,1]
a_i=0
i\geq2
-4\leq\mathbb{Z}\leq4
i\geq3
-13\leq\mathbb{Z}\leq13
i\geq4
-40\leq\mathbb{Z}\leq40
i=7
-3280\leq\mathbb{Z}\leq3280
\mathbb{Z}<0
0\leq\mathbb{Z}\leq3280
\boxed{\textbf{(D) } 3281}$. --anna0kear
==Solution 7==
To get the number of integers, we can get the highest positive integer that can be represented using <cmath>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,</cmath>
where$ (Error compiling LaTeX. Unknown error_msg)a_i\in \{-1,0,1\}0\le i \le 7$.
Note that the least nonnegative integer that can be represented is$ (Error compiling LaTeX. Unknown error_msg)0a_i=0
a_i=1$. That will be <cmath>3^7+3^6+3^5+3^4+3^3+3^2+3^1+3^0=\frac{3^8-1}{3-1}</cmath> <cmath>=3280</cmath>
Therefore, there are$ (Error compiling LaTeX. Unknown error_msg)3280(3280+1)
0
\boxed{\textbf{(D) } 3281}$~OlutosinNGA
==Solution 8==
Notice that there are$ (Error compiling LaTeX. Unknown error_msg)3^8a_7, a_6, \cdots a_0
a_i
-1
0
1
0$(they are asking for non-negative).
By symmetry(look out for these on the contest), we see that exactly half of them are positive. So$ (Error compiling LaTeX. Unknown error_msg)\lfloor{\tfrac{3^8}{2}}\rfloor = 3280.1
0$to account for the non-negative solutions.
So our final answer is$ (Error compiling LaTeX. Unknown error_msg)3280 + 1 = 3281\boxed{\textbf{(D) } 3281}$.
Video Solution
~IceMatrix
See Also
2018 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 17 |
Followed by Problem 19 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
2018 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 12 |
Followed by Problem 14 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.