Difference between revisions of "2021 Fall AMC 10A Problems/Problem 18"
(→Problem) |
MRENTHUSIASM (talk | contribs) |
||
(25 intermediate revisions by 11 users not shown) | |||
Line 8: | Line 8: | ||
<math>\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 64 \qquad \textbf{(C)}\ 84 \qquad \textbf{(D)}\ 90 \qquad \textbf{(E)}\ 144</math> | <math>\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 64 \qquad \textbf{(C)}\ 84 \qquad \textbf{(D)}\ 90 \qquad \textbf{(E)}\ 144</math> | ||
− | == | + | ==Solution 1 (Casework)== |
− | The top right | + | There are <math>4</math> possibilities for the top-left section. It follows that the top-right and bottom-left sections each have <math>3</math> possibilities, so they have <math>3^2=9</math> combinations. We have two cases: |
+ | <ol style="margin-left: 1.5em;"> | ||
+ | <li><b>The top-right and bottom-left sections have the same crop.</b></li><p> | ||
+ | Note that <math>3</math> of the <math>9</math> combinations of the top-right and bottom-left sections satisfy this case, from which the bottom-right section has <math>3</math> possibilities. Therefore, there are <math>4\cdot3\cdot3=36</math> ways in this case. <p> | ||
+ | <li><b>The top-right and bottom-left sections have different crops.</b></li><p> | ||
+ | Note that <math>6</math> of the <math>9</math> combinations of the top-right and bottom-left sections satisfy this case, from which the bottom-right section has <math>2</math> possibilities. Therefore, there are <math>4\cdot6\cdot2=48</math> ways in this case. <p> | ||
+ | </ol> | ||
+ | Together, the answer is <math>36+48=\boxed{\textbf{(C)}\ 84}.</math> | ||
− | - Aidensharp | + | ~Arcticturn ~MRENTHUSIASM |
+ | |||
+ | ==Solution 2 (Casework)== | ||
+ | We will do casework on the type of crops in the field. | ||
+ | |||
+ | <b>Case 1: all of a kind.</b> | ||
+ | |||
+ | If all four sections have the same type of crop, there are simply <math>\underline{4}</math> ways to choose crops for the sections. | ||
+ | |||
+ | <b>Case 2: <math>\boldsymbol{3}</math> of a kind, <math>\boldsymbol{1}</math> of another kind.</b> | ||
+ | |||
+ | Since the one of another kind must be adjacent to two of the other crops, when choosing the type of crops in this case, we cannot choose soybeans and potatoes, or corn and wheat. Therefore, there are <math>4 \cdot 3 - 2 \cdot 2 = 8</math> choices for the two crops we choose for the section (notice we did not choose by <math>2</math>, since the crop we pick first will be the unique one), and <math>4</math> ways to choose which section the unique crop is planted on. This gives us a total of <math>4 \cdot 8 = \underline{32}</math> ways to choose crops for the sections. | ||
+ | |||
+ | <b>Case 3: <math>\boldsymbol{2}</math> of a kind, <math>\boldsymbol{2}</math> of another kind.</b> | ||
+ | |||
+ | We cannot choose corn and wheat, or soybeans and potatoes, once again, because if we do, the two would have to be adjacent in some way, which the problem disallows. So, there are <math>{4 \choose 2} - 2 = 4</math> ways to choose our two crops (notice that we did choose by <math>2</math>, since there are two of both crops). There are <math>{4 \choose 2} = 6</math> ways to choose where one of the crops go, so there are <math>4 \cdot 6 = \underline{24}</math> ways to choose crops for the sections. | ||
+ | |||
+ | <b>Case 4: <math>\boldsymbol{2}</math> of a kind, <math>\boldsymbol{1}</math> of another kind, <math>\boldsymbol{1}</math> of another kind.</b> | ||
+ | |||
+ | In cases 2 and 3, we excluded the possibility of choosing bad pairs for our crops (i.e. soybeans and potatoes, or corn and wheat). In this case, it is inevitable that we choose a bad pair, because we are choosing <math>3</math> crops this time. The two sections of the same kind must contain the crop that is not part of the bad pair in the trio: for example, if we choose corn, soybeans and potatoes as our three crop types, nor soybeans and potatoes can be the type which occupies two sections in this case; corn must be the one to do so. There are <math>4</math> ways to choose the crop that is not part of the bad pair, and then <math>1</math> way to choose the bad pair, giving us <math>4 \cdot 1 = 4</math> ways to choose the crops. To separate the bad pair of crops, the two of a kind must be diagonally placed. There are <math>2</math> ways to choose where the two of a kind go, and <math>2</math> ways to choose which of the bad pair goes where, giving us <math>2 \cdot 2 = 4</math> ways to choose the positions for the crops. In total, there are <math>4 \cdot 4 = \underline{16}</math> ways to choose crops for the sections. | ||
+ | |||
+ | <b>Case 5: every single crop.</b> | ||
+ | |||
+ | Bad pairs must be on the same diagonal, so there are <math>2</math> ways to choose which pair gets which diagonal, and <math>2 \cdot 2 = 4</math> ways to choose which of each pair goes where on the diagonal, giving us <math>2 \cdot 4 = \underline{8}</math> ways to choose crops for the sections. | ||
+ | |||
+ | Adding up all our values, we get our final answer of <math>4+32+24+16+8 = \boxed{\textbf{(C)}\ 84}</math>. | ||
+ | |||
+ | ~ihatemath123 | ||
+ | |||
+ | == Solution 3 (Casework) == | ||
+ | To lighten notation, we use C, W, S, P to denote corn, wheat, soybeans, and potatoes, respectively. | ||
+ | |||
+ | We use I, II, III, IV to denote four quadrants, respectively. | ||
+ | |||
+ | We determine an arrangement in the following steps. | ||
+ | |||
+ | Step 1: Determine the crop planted in I. | ||
+ | |||
+ | The number of ways is <math>4</math>. | ||
+ | |||
+ | Step 2: Determine the crops planed in II, III, IV. | ||
+ | |||
+ | To find the number of arrangements in this step, without loss of generality, we assume that we plant C in I. | ||
+ | |||
+ | We do the following casework analysis. | ||
+ | |||
+ | Case 1: Both II and IV are planted with C. | ||
+ | |||
+ | In this case, the number of ways to plant in III is <math>3</math>. | ||
+ | |||
+ | Case 2: In II and IV, only one quadrant is planted with C, and another quadrant is planted with either S or P. | ||
+ | |||
+ | In this case, we determine an arrangement in the following steps. | ||
+ | |||
+ | Step 2.1: Determine whether C is planted in II or IV. | ||
+ | |||
+ | The number of ways is <math>2</math>. | ||
+ | |||
+ | Step 2.2: In II or IV not planted with C, determine whether it is planted with S or P. | ||
+ | |||
+ | The number of ways is <math>2</math>. | ||
+ | |||
+ | Step 2.3: Determine the crop planted in III. | ||
+ | |||
+ | The number of ways is <math>2</math>. | ||
+ | |||
+ | Following from the rule of product, the number of ways in this case is <math>2 \cdot 2 \cdot 2 = 8</math>. | ||
+ | |||
+ | Case 3: II and IV are both planted with S or W. | ||
+ | |||
+ | In this case, we determine an arrangement in the following steps. | ||
+ | |||
+ | Step 2.1: Determine whether S or W is planted in II and IV. | ||
+ | |||
+ | The number of ways is <math>2</math>. | ||
+ | |||
+ | Step 2.2: Determine the crop planted in III. | ||
+ | |||
+ | The number of ways is <math>3</math>. | ||
+ | |||
+ | Following from the rule of product, the number of ways in this case is <math>2 \cdot 3 = 6</math>. | ||
+ | |||
+ | Case 4: In II and IV, exactly one quadrant is planted with S and another one is planted with W. | ||
+ | |||
+ | Step 2.1: Determine which quadrant in II and IV is planted with S. | ||
+ | |||
+ | The number of ways is <math>2</math>. | ||
+ | |||
+ | Step 2.2: Determine the crop planted in III. | ||
+ | |||
+ | The number of ways is <math>2</math>. | ||
+ | |||
+ | Following from the rule of product, the number of ways in this case is <math>2 \cdot 2 = 4</math>. | ||
+ | |||
+ | Putting all cases together, the total number of arrangements in Step 2 is <math>3 + 8 + 6 + 4 = 21</math>. | ||
+ | |||
+ | Following from the rule of product, the total number of arrangements is <math>4 \cdot 21 = 84</math>. | ||
+ | |||
+ | Therefore, the answer is <math>\boxed{\textbf{(C)}\ 84}</math>. | ||
+ | |||
+ | ~Steven Chen (www.professorchenedu.com) | ||
+ | |||
+ | ==Solution 4 (Principle of Inclusion-Exclusion) == | ||
+ | |||
+ | The number of cases with at least one pair of corn and wheat adjacent is <math>4 \cdot 2 \cdot 4^2 - 4 \cdot 2 \cdot 4 + 0 - 2 = 94</math> possible fields (You can easily see this for yourself using PIE.), and WLOG, the same goes for soybean and potatoes. Now, applying PIE on both sets (number of cases with at least one pair of corn and wheat and the number of cases with at least one pair of soybeans and potatoes) yields <math>2\cdot94 - 16 = 172</math>. We want the number of cases <b>without</b> adjacent pairs of soybeans and potatoes or wheat and corn, so we subtract <math>256 - 172</math>, yielding an answer of <math>\boxed{\textbf{(C)}\ 84}.</math> | ||
+ | |||
+ | ~ icecreamrolls8 | ||
+ | |||
+ | ==Solution 5 (Tree Diagram)== | ||
+ | We can create a tree representing an arbitrary box we start with and the possibilities for other boxes around the grid. We can just designate the crop we start with as <math>1</math>, and the other crops as <math>2</math>, <math>3</math>, and <math>4</math>, where <math>1</math> cannot be next to <math>2</math> and <math>3</math> cannot be next to <math>4</math> in the grid. | ||
+ | <asy> | ||
+ | size(400); | ||
+ | |||
+ | draw((0, 0)--(-10, -2)--(-13, -4)--(-14, -6)); | ||
+ | draw((-13, -4)--(-13,-6)); | ||
+ | draw((-13, -4)--(-12,-6)); | ||
+ | draw((-10, -2)--(-10, -4)--(-10.5, -6)); | ||
+ | draw((-10, -4)--(-9.5, -6)); | ||
+ | draw((-10, -2)--(-7, -4)--(-7.5, -6)); | ||
+ | draw((-7, -4)--(-6.5, -6)); | ||
+ | |||
+ | label("$1$", (0, 0), N); | ||
+ | label("$1$", (-10, -2), UnFill(0.5mm)); | ||
+ | label("$1$", (-13, -4), UnFill(0.5mm)); | ||
+ | label("$1$", (-14, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (-13, -6), UnFill(0.5mm)); | ||
+ | label("$4$", (-12, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (-10, -4), UnFill(0.5mm)); | ||
+ | label("$1$", (-10.5, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (-9.5, -6), UnFill(0.5mm)); | ||
+ | label("$4$", (-7, -4), UnFill(0.5mm)); | ||
+ | label("$1$", (-7.5, -6), UnFill(0.5mm)); | ||
+ | label("$4$", (-6.5, -6), UnFill(0.5mm)); | ||
+ | |||
+ | draw((0, 0)--(0, -2)--(-3, -4)--(-4, -6)); | ||
+ | draw((-3, -4)--(-3, -6)); | ||
+ | draw((-3, -4)--(-2, -6)); | ||
+ | draw((0, -2)--(0, -4)--(-0.5, -6)); | ||
+ | draw((0, -4)--(0.5, -6)); | ||
+ | draw((0, -2)--(3, -4)--(2.5, -6)); | ||
+ | draw((3, -4)--(3.5, -6)); | ||
+ | |||
+ | label("$3$", (0, -2), UnFill(0.5mm)); | ||
+ | label("$1$", (-3, -4), UnFill(0.5mm)); | ||
+ | label("$2$", (0, -4), UnFill(0.5mm)); | ||
+ | label("$3$", (3, -4), UnFill(0.5mm)); | ||
+ | label("$4$", (-2, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (-3, -6), UnFill(0.5mm)); | ||
+ | label("$1$", (-4, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (-0.5, -6), UnFill(0.5mm)); | ||
+ | label("$4$", (0.5, -6), UnFill(0.5mm)); | ||
+ | label("$1$", (2.5, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (3.5, -6), UnFill(0.5mm)); | ||
+ | |||
+ | draw((0, 0)--(10, -2)--(13, -4)--(13.5, -6)); | ||
+ | draw((13, -4)--(12.5,-6)); | ||
+ | draw((10, -2)--(10, -4)--(10.5, -6)); | ||
+ | draw((10, -4)--(9.5, -6)); | ||
+ | draw((10, -2)--(7, -4)--(8, -6)); | ||
+ | draw((7, -4)--(7, -6)); | ||
+ | draw((7, -4)--(6, -6)); | ||
+ | |||
+ | label("$4$", (10, -2), UnFill(0.5mm)); | ||
+ | label("$4$", (13, -4), UnFill(0.5mm)); | ||
+ | label("$4$", (13.5, -6), UnFill(0.5mm)); | ||
+ | label("$1$", (12.5, -6), UnFill(0.5mm)); | ||
+ | label("$2$", (10, -4), UnFill(0.5mm)); | ||
+ | label("$4$", (10.5, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (9.5, -6), UnFill(0.5mm)); | ||
+ | label("$1$", (7, -4), UnFill(0.5mm)); | ||
+ | label("$4$", (8, -6), UnFill(0.5mm)); | ||
+ | label("$3$", (7, -6), UnFill(0.5mm)); | ||
+ | label("$1$", (6, -6), UnFill(0.5mm)); | ||
+ | </asy> | ||
+ | As we can see, there are <math>21</math> possibilities. We multiply this by the <math>4</math> (the number of possibilities there are for the crop we started with), so our answer is <math>\boxed{\textbf{(C)}\ 84}</math>. | ||
+ | |||
+ | ~NonOxyCrustacean | ||
+ | |||
+ | ==Solution 6 (Educated Guess)== | ||
+ | The top right box has <math>4</math> choices and the top left box has <math>3</math> choices. Thus, it is reasonable to assume that the answer is a multiple of <math>12</math>. We know that the answer will not be too small or too large, so the answer is <math>\boxed{\textbf{(C)}\ 84}</math>. | ||
+ | |||
+ | ~Aidensharp | ||
+ | |||
+ | |||
+ | ==Video Solution (Just 2 min!)== | ||
+ | https://youtu.be/1II04QhD9Bs | ||
+ | |||
+ | <i>~Education, the Study of Everything</i> | ||
+ | |||
+ | ==Video Solution by TheBeautyofMath== | ||
+ | https://youtu.be/n5_he263qe8 | ||
+ | |||
+ | ~IceMatrix | ||
+ | |||
+ | == Video Solution by OmegaLearn == | ||
+ | https://youtu.be/kxgUdv_L-ys?t=372 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
+ | |||
+ | ==See Also== | ||
+ | {{AMC10 box|year=2021 Fall|ab=A|num-b=17|num-a=19}} | ||
+ | {{MAA Notice}} |
Latest revision as of 12:30, 25 May 2024
Contents
Problem
A farmer's rectangular field is partitioned into by
grid of
rectangular sections as shown in the figure. In each section the farmer will plant one crop: corn, wheat, soybeans, or potatoes. The farmer does not want to grow corn and wheat in any two sections that share a border, and the farmer does not want to grow soybeans and potatoes in any two sections that share a border. Given these restrictions, in how many ways can the farmer choose crops to plant in each of the four sections of the field?
Solution 1 (Casework)
There are possibilities for the top-left section. It follows that the top-right and bottom-left sections each have
possibilities, so they have
combinations. We have two cases:
- The top-right and bottom-left sections have the same crop.
- The top-right and bottom-left sections have different crops.
Note that of the
combinations of the top-right and bottom-left sections satisfy this case, from which the bottom-right section has
possibilities. Therefore, there are
ways in this case.
Note that of the
combinations of the top-right and bottom-left sections satisfy this case, from which the bottom-right section has
possibilities. Therefore, there are
ways in this case.
Together, the answer is
~Arcticturn ~MRENTHUSIASM
Solution 2 (Casework)
We will do casework on the type of crops in the field.
Case 1: all of a kind.
If all four sections have the same type of crop, there are simply ways to choose crops for the sections.
Case 2: of a kind,
of another kind.
Since the one of another kind must be adjacent to two of the other crops, when choosing the type of crops in this case, we cannot choose soybeans and potatoes, or corn and wheat. Therefore, there are choices for the two crops we choose for the section (notice we did not choose by
, since the crop we pick first will be the unique one), and
ways to choose which section the unique crop is planted on. This gives us a total of
ways to choose crops for the sections.
Case 3: of a kind,
of another kind.
We cannot choose corn and wheat, or soybeans and potatoes, once again, because if we do, the two would have to be adjacent in some way, which the problem disallows. So, there are ways to choose our two crops (notice that we did choose by
, since there are two of both crops). There are
ways to choose where one of the crops go, so there are
ways to choose crops for the sections.
Case 4: of a kind,
of another kind,
of another kind.
In cases 2 and 3, we excluded the possibility of choosing bad pairs for our crops (i.e. soybeans and potatoes, or corn and wheat). In this case, it is inevitable that we choose a bad pair, because we are choosing crops this time. The two sections of the same kind must contain the crop that is not part of the bad pair in the trio: for example, if we choose corn, soybeans and potatoes as our three crop types, nor soybeans and potatoes can be the type which occupies two sections in this case; corn must be the one to do so. There are
ways to choose the crop that is not part of the bad pair, and then
way to choose the bad pair, giving us
ways to choose the crops. To separate the bad pair of crops, the two of a kind must be diagonally placed. There are
ways to choose where the two of a kind go, and
ways to choose which of the bad pair goes where, giving us
ways to choose the positions for the crops. In total, there are
ways to choose crops for the sections.
Case 5: every single crop.
Bad pairs must be on the same diagonal, so there are ways to choose which pair gets which diagonal, and
ways to choose which of each pair goes where on the diagonal, giving us
ways to choose crops for the sections.
Adding up all our values, we get our final answer of .
~ihatemath123
Solution 3 (Casework)
To lighten notation, we use C, W, S, P to denote corn, wheat, soybeans, and potatoes, respectively.
We use I, II, III, IV to denote four quadrants, respectively.
We determine an arrangement in the following steps.
Step 1: Determine the crop planted in I.
The number of ways is .
Step 2: Determine the crops planed in II, III, IV.
To find the number of arrangements in this step, without loss of generality, we assume that we plant C in I.
We do the following casework analysis.
Case 1: Both II and IV are planted with C.
In this case, the number of ways to plant in III is .
Case 2: In II and IV, only one quadrant is planted with C, and another quadrant is planted with either S or P.
In this case, we determine an arrangement in the following steps.
Step 2.1: Determine whether C is planted in II or IV.
The number of ways is .
Step 2.2: In II or IV not planted with C, determine whether it is planted with S or P.
The number of ways is .
Step 2.3: Determine the crop planted in III.
The number of ways is .
Following from the rule of product, the number of ways in this case is .
Case 3: II and IV are both planted with S or W.
In this case, we determine an arrangement in the following steps.
Step 2.1: Determine whether S or W is planted in II and IV.
The number of ways is .
Step 2.2: Determine the crop planted in III.
The number of ways is .
Following from the rule of product, the number of ways in this case is .
Case 4: In II and IV, exactly one quadrant is planted with S and another one is planted with W.
Step 2.1: Determine which quadrant in II and IV is planted with S.
The number of ways is .
Step 2.2: Determine the crop planted in III.
The number of ways is .
Following from the rule of product, the number of ways in this case is .
Putting all cases together, the total number of arrangements in Step 2 is .
Following from the rule of product, the total number of arrangements is .
Therefore, the answer is .
~Steven Chen (www.professorchenedu.com)
Solution 4 (Principle of Inclusion-Exclusion)
The number of cases with at least one pair of corn and wheat adjacent is possible fields (You can easily see this for yourself using PIE.), and WLOG, the same goes for soybean and potatoes. Now, applying PIE on both sets (number of cases with at least one pair of corn and wheat and the number of cases with at least one pair of soybeans and potatoes) yields
. We want the number of cases without adjacent pairs of soybeans and potatoes or wheat and corn, so we subtract
, yielding an answer of
~ icecreamrolls8
Solution 5 (Tree Diagram)
We can create a tree representing an arbitrary box we start with and the possibilities for other boxes around the grid. We can just designate the crop we start with as , and the other crops as
,
, and
, where
cannot be next to
and
cannot be next to
in the grid.
As we can see, there are
possibilities. We multiply this by the
(the number of possibilities there are for the crop we started with), so our answer is
.
~NonOxyCrustacean
Solution 6 (Educated Guess)
The top right box has choices and the top left box has
choices. Thus, it is reasonable to assume that the answer is a multiple of
. We know that the answer will not be too small or too large, so the answer is
.
~Aidensharp
Video Solution (Just 2 min!)
~Education, the Study of Everything
Video Solution by TheBeautyofMath
~IceMatrix
Video Solution by OmegaLearn
https://youtu.be/kxgUdv_L-ys?t=372
~ pi_is_3.14
See Also
2021 Fall 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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.