Difference between revisions of "2012 AMC 10B Problems/Problem 22"

(Problem 22)
(Problem 22)
Line 5: Line 5:
 
<math>\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880</math>
 
<math>\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880</math>
  
                                                                                                                            SOLUTION 1
+
==Solution 1==
 
If we have 1 as the first number, then the only possible list is <math>(1,2,3,4,5,6,7,8,9,10)</math>.  
 
If we have 1 as the first number, then the only possible list is <math>(1,2,3,4,5,6,7,8,9,10)</math>.  
  
Line 19: Line 19:
  
 
   
 
   
                                                                                                                              SOLUTION 2
+
==Solution 2==
 
Arrange the spaces and put arrows pointing either up or down between them. Then for each arrangement of arrows there is one and only one list that corresponds to up. For example, all arrows pointing up is <math>(1,2,3,4,5...10)</math>. There are 9 arrows, so the answer is <math>2^{9}</math> = <math>512</math>
 
Arrange the spaces and put arrows pointing either up or down between them. Then for each arrangement of arrows there is one and only one list that corresponds to up. For example, all arrows pointing up is <math>(1,2,3,4,5...10)</math>. There are 9 arrows, so the answer is <math>2^{9}</math> = <math>512</math>
  
 
NOTE:
 
NOTE:
 
These are not my answers. They come from http://www.artofproblemsolving.com/Videos/external.php?video_id=269. I just decided to write it, if you are too lazy to view the video.
 
These are not my answers. They come from http://www.artofproblemsolving.com/Videos/external.php?video_id=269. I just decided to write it, if you are too lazy to view the video.
 +
== See Also ==
 +
 +
 +
{{AMC10 box|year=2012|ab=B|num-b=21|num-a=23}}

Revision as of 20:17, 17 February 2013

Problem 22

Let ($a_1$, $a_2$, ... $a_{10}$) be a list of the first 10 positive integers such that for each $2\le$ $i$ $\le10$ either $a_i + 1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?


$\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880$

Solution 1

If we have 1 as the first number, then the only possible list is $(1,2,3,4,5,6,7,8,9,10)$.

If we have 2 as the first number, then we have 9 ways to choose where the one goes, and the numbers ascend from the first number, 2, with the exception of the 1. For example, $(2,3,1,4,5,6,7,8,9,10)$, or $(2,3,4,1,5,6,7,8,9,10)$. There are $\dbinom{9}{1}$ ways to do so.

If we use 3 as the first number, we need to choose 2 spaces to be 2 and 1, respectively. There are $\dbinom{9}{2}$ ways to do this.

In the same way, the total number of lists is: $\dbinom{9}{1} + \dbinom{9}{2} + \dbinom{9}{3} + \dbinom{9}{4}.....\dbinom{9}{10}$

By the binomial theorem, this is $2^{9}$ = $512$, or $(A)$


Solution 2

Arrange the spaces and put arrows pointing either up or down between them. Then for each arrangement of arrows there is one and only one list that corresponds to up. For example, all arrows pointing up is $(1,2,3,4,5...10)$. There are 9 arrows, so the answer is $2^{9}$ = $512$

NOTE: These are not my answers. They come from http://www.artofproblemsolving.com/Videos/external.php?video_id=269. I just decided to write it, if you are too lazy to view the video.

See Also

2012 AMC 10B (ProblemsAnswer KeyResources)
Preceded by
Problem 21
Followed by
Problem 23
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