|
|
| Line 3: |
Line 3: |
| | | | |
| | <math>\textbf{(A) }6 \qquad \textbf{(B) }8 \qquad \textbf{(C) }12 \qquad \textbf{(D) }18 \qquad \textbf{(E) }24</math> | | <math>\textbf{(A) }6 \qquad \textbf{(B) }8 \qquad \textbf{(C) }12 \qquad \textbf{(D) }18 \qquad \textbf{(E) }24</math> |
| | + | |
| | ==Solution 1== | | ==Solution 1== |
| − | By the [[Georgeooga-Harryooga Theorem]] there are <math>\frac{(4-2)!(4-2+1)!}{(4-2\cdot2+1)!}=\boxed{\textbf{(C) }12}</math> way to arrange the marbles.
| + | Write <math>S</math> and <math>T</math> for the Steelie and the Tiger respectively. Putting in <math>S</math> and <math>T</math> first, in order to avoid them being next to each other, we must have the arrangement <math>S\square T\square</math>, <math>S\square\square T</math>, <math>\square S\square T</math>, or any of these with the <math>S</math> and <math>T</math> swapped. This gives <math>3 \cdot 2 = 6</math> ways, and there are then <math>2</math> ways to put in the Aggie and Bumbleebee, for a total of <math>2\cdot 6=\boxed{\textbf{(C) }12}</math>. |
| − | | |
| − | | |
| − | Solution by [[User:RedFireTruck|RedFireTruck]]
| |
| − | | |
| − | ==Solution 2==
| |
| − | We can arrange our marbles like so <math>\square A\square B\square</math>.
| |
| − | | |
| − | To arrange the <math>A</math> and <math>B</math> we have <math>2!=2</math> ways.
| |
| − | | |
| − | To place the <math>S</math> and <math>T</math> in the blanks we have <math>_3P_2=6</math> ways.
| |
| − | | |
| − | By fundamental counting principle our final answer is <math>2\cdot6=\boxed{\textbf{(C) }12}</math>
| |
| − | | |
| − | | |
| − | Solution by [[User:Redfiretruck|RedFireTruck]]
| |
| − | | |
| − | ==Solution 3==
| |
| − | Let the Aggie, Bumblebee, Steelie, and Tiger, be referred to by <math>A,B,S,</math> and <math>T</math>, respectively. If we ignore the constraint that <math>S</math> and <math>T</math> cannot be next to each other, we get a total of <math>4!=24</math> ways to arrange the 4 marbles. We now simply have to subtract out the number of ways that <math>S</math> and <math>T</math> can be next to each other. If we place <math>S</math> and <math>T</math> next to each other in that order, then there are three places that we can place them, namely in the first two slots, in the second two slots, or in the last two slots (i.e. <math>ST\square\square, \square ST\square, \square\square ST</math>). However, we could also have placed <math>S</math> and <math>T</math> in the opposite order (i.e. <math>TS\square\square, \square TS\square, \square\square TS</math>). Thus there are 6 ways of placing <math>S</math> and <math>T</math> directly next to each other. Next, notice that for each of these placements, we have two open slots for placing <math>A</math> and <math>B</math>. Specifically, we can place <math>A</math> in the first open slot and <math>B</math> in the second open slot or switch their order and place <math>B</math> in the first open slot and <math>A</math> in the second open slot. This gives us a total of <math>6\times 2=12</math> ways to place <math>S</math> and <math>T</math> next to each other. Subtracting this from the total number of arrangements gives us <math>24-12=12</math> total arrangements <math>\implies\boxed{\textbf{(C) }12}</math>.<br>
| |
| − | | |
| − | We can also solve this problem directly by looking at the number of ways that we can place <math>S</math> and <math>T</math> such that they are not directly next to each other. Observe that there are three ways to place <math>S</math> and <math>T</math> (in that order) into the four slots so they are not next to each other (i.e. <math>S\square T\square, \square S\square T, S\square\square T</math>). However, we could also have placed <math>S</math> and <math>T</math> in the opposite order (i.e. <math>T\square S\square, \square T\square S, T\square\square S</math>). Thus there are 6 ways of placing <math>S</math> and <math>T</math> so that they are not next to each other. Next, notice that for each of these placements, we have two open slots for placing <math>A</math> and <math>B</math>. Specifically, we can place <math>A</math> in the first open slot and <math>B</math> in the second open slot or switch their order and place <math>B</math> in the first open slot and <math>A</math> in the second open slot. This gives us a total of <math>6\times 2=12</math> ways to place <math>S</math> and <math>T</math> such that they are not next to each other <math>\implies\boxed{\textbf{(C) }12}</math>.<br>
| |
| − | ~[http://artofproblemsolving.com/community/user/jmansuri junaidmansuri]
| |
| − | | |
| − | ==Solution 4==
| |
| − | Let's try complementary counting. There <math>4!</math> ways to arrange the 4 marbles. However, there are <math>2\cdot3!</math> arrangements where Steelie and Tiger are next to each other. (Think about permutations of the element ST, A, and B or TS, A, and B). Thus, <cmath>4!-2\cdot3!=\boxed{12 \textbf{(C)}}</cmath>
| |
| − | | |
| − | ==Solution 5==
| |
| − | | |
| − | We use complementary counting: we will count the numbers of ways where Steelie and Tiger are together and subtract that from the total count. Treat the Steelie and the Tiger as a "super marble." There are <math>2!</math> ways to arrange Steelie and Tiger within this "super marble." Then there are <math>3!</math> ways to arrange the "super marble" and Zara's two other marbles in a row. Since there are <math>4!</math> ways to arrange the marbles without any restrictions, the answer is given by <math>4!-2!\cdot 3!=\textbf{(C) }12</math>
| |
| − | | |
| − | -franzliszt
| |
| − | | |
| − | ==Solution 6==
| |
| − | | |
| − | We will use the following
| |
| − | | |
| − | <math>\textbf{Georgeooga-Harryooga Theorem:}</math> The [[Georgeooga-Harryooga Theorem]] states that if you have <math>a</math> distinguishable objects and <math>b</math> of them cannot be together, then there are <math>\frac{(a-b)!(a-b+1)!}{b!}</math> ways to arrange the objects.
| |
| − | | |
| − | <math>\textit{Proof. (Created by AoPS user RedFireTruck)}</math>
| |
| − | | |
| − | Let our group of <math>a</math> objects be represented like so <math>1</math>, <math>2</math>, <math>3</math>, ..., <math>a-1</math>, <math>a</math>. Let the last <math>b</math> objects be the ones we can't have together.
| |
| − | | |
| − | Then we can organize our objects like so <math>\square1\square2\square3\square...\square a-b-1\square a-b\square</math>.
| |
| − | | |
| − | We have <math>(a-b)!</math> ways to arrange the objects in that list.
| |
| − | | |
| − | Now we have <math>a-b+1</math> blanks and <math>b</math> other objects so we have <math>_{a-b+1}P_{b}=\frac{(a-b+1)!}{(a-2b+1)!}</math> ways to arrange the objects we can't put together.
| |
| − | | |
| − | By fundamental counting principal our answer is <math>\frac{(a-b)!(a-b+1)!}{(a-2b+1)!}</math>.
| |
| | | | |
| | + | ==Solution 2 (complementary counting)== |
| | + | There would be <math>4!=24</math> ways to arrange the <math>4</math> marbles, except for the condition that the Steelie and Tiger cannot be next to each other. If we did place them next to each other with the Steelie first, there would be <math>3</math> ways to place them (namely <math>ST\square\square</math>, <math>\square ST\square</math>; or <math>\square\square ST</math>, where <math>S</math> and <math>T</math> denote the Steelie and the Tiger as in Solution 1). Accounting for the other possible order, there are a total of <math>3 \cdot 2 = 6</math> ways. Now, there are <math>2</math> ways to place <math>A</math> and <math>B</math>, giving overall <math>6 \cdot 2 = 12</math> ways to arrange the marbles with <math>S</math> and <math>T</math> next to each other. Subtracting this from <math>24</math> (to remove the cases which are not allowed) gives <math>24-12=\boxed{\textbf{(C) }12}</math> valid ways to arrange the marbles. |
| | | | |
| − | Proof by [[User:Redfiretruck|RedFireTruck]]
| + | ==Solution 3 (variant of Solution 2)== |
| − | | + | As in Solution 2, there are <math>24</math> total ways to arrange the marbles without any constraints. To count the number of ways where the Steelie and the Tiger are next to each other, we treat them together as a "super marble". There are <math>2</math> ways to arrange the Steelie and Tiger within the super marble, then <math>3! = 6</math> ways to put the super marble in a row with the Aggie and the Bumblebee. Thus the answer is <math>24-2\cdot 6=\boxed{\textbf{(C) }12}</math>. |
| − | | |
| − | Back to the problem. By the [[Georgeooga-Harryooga Theorem]], our answer is <math>\frac{(4-2)!(4-2+1)!}{(4-2\cdot2+1)!}=\textbf{(C) }12</math>.
| |
| − | | |
| − | -franzliszt
| |
| | | | |
| | ==Video Solution== | | ==Video Solution== |
| | https://youtu.be/pB46JzBNM6g | | https://youtu.be/pB46JzBNM6g |
| − |
| |
| − | ~savannahsolver
| |
| | | | |
| | ==See also== | | ==See also== |
| | {{AMC8 box|year=2020|num-b=9|num-a=11}} | | {{AMC8 box|year=2020|num-b=9|num-a=11}} |
| | {{MAA Notice}} | | {{MAA Notice}} |
Problem
Zara has a collection of 
marbles: an Aggie, a Bumblebee, a Steelie, and a Tiger. She wants to display them in a row on a shelf, but does not want to put the Steelie and the Tiger next to one another. In how many ways can she do this?
Solution 1
Write 
and 
for the Steelie and the Tiger respectively. Putting in and first, in order to avoid them being next to each other, we must have the arrangement 
, 
, 
, or any of these with the and swapped. This gives 
ways, and there are then 
ways to put in the Aggie and Bumbleebee, for a total of 
.
Solution 2 (complementary counting)
There would be 
ways to arrange the marbles, except for the condition that the Steelie and Tiger cannot be next to each other. If we did place them next to each other with the Steelie first, there would be 
ways to place them (namely 
, 
; or 
, where and denote the Steelie and the Tiger as in Solution 1). Accounting for the other possible order, there are a total of ways. Now, there are ways to place 
and 
, giving overall 
ways to arrange the marbles with and next to each other. Subtracting this from 
(to remove the cases which are not allowed) gives 
valid ways to arrange the marbles.
Solution 3 (variant of Solution 2)
As in Solution 2, there are total ways to arrange the marbles without any constraints. To count the number of ways where the Steelie and the Tiger are next to each other, we treat them together as a "super marble". There are ways to arrange the Steelie and Tiger within the super marble, then 
ways to put the super marble in a row with the Aggie and the Bumblebee. Thus the answer is 
.
Video Solution
https://youtu.be/pB46JzBNM6g
See also
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
marbles: an Aggie, a Bumblebee, a Steelie, and a Tiger. She wants to display them in a row on a shelf, but does not want to put the Steelie and the Tiger next to one another. In how many ways can she do this?
and 
for the Steelie and the Tiger respectively. Putting in 
, 
, 
, or any of these with the 
ways, and there are then 
ways to put in the Aggie and Bumbleebee, for a total of 
.
ways to arrange the 
ways to place them (namely 
, 
; or 
, where 
and 
, giving overall 
ways to arrange the marbles with 
(to remove the cases which are not allowed) gives 
valid ways to arrange the marbles.
ways to put the super marble in a row with the Aggie and the Bumblebee. Thus the answer is 
.
