Difference between revisions of "2021 AMC 10A Problems/Problem 25"
MRENTHUSIASM (talk | contribs) m (→Solution 2 (Casework)) |
MRENTHUSIASM (talk | contribs) (→Solution 2 (Casework): Replaced everything with Asymptote for practice.) |
||
Line 117: | Line 117: | ||
<u><b>Case (2): The two balls adjacent to the top-left red ball have the same color.</b></u> | <u><b>Case (2): The two balls adjacent to the top-left red ball have the same color.</b></u> | ||
− | < | + | <asy> |
− | + | unitsize(7mm); | |
− | + | add(grid(15,3,white)); | |
− | + | ||
− | + | fill((6,2)--(7,2)--(7,3)--(6,3)--cycle, red); | |
− | + | fill((7,2)--(8,2)--(8,3)--(7,3)--cycle, blue); | |
− | + | fill((6,1)--(7,1)--(7,2)--(6,2)--cycle, blue); | |
− | + | draw((6,0)--(9,0)--(9,3)--(6,3)--cycle, linewidth(1.5)); | |
− | + | draw((6,1)--(9,1), linewidth(1.5)); | |
+ | draw((6,2)--(9,2), linewidth(1.5)); | ||
+ | draw((7,0)--(7,3), linewidth(1.5)); | ||
+ | draw((8,0)--(8,3), linewidth(1.5)); | ||
+ | </asy> | ||
Each placement has <math>6</math> permutations, as there are <math>\binom32\binom21=6</math> ways to choose three balls consisting of exactly two colors (RBB, RGG, BRR, BGG, GRR, GBB). | Each placement has <math>6</math> permutations, as there are <math>\binom32\binom21=6</math> ways to choose three balls consisting of exactly two colors (RBB, RGG, BRR, BGG, GRR, GBB). | ||
There are three sub-cases for Case (2): | There are three sub-cases for Case (2): | ||
− | < | + | <asy> |
− | + | unitsize(7mm); | |
− | + | add(grid(15,3,white)); | |
− | + | fill((0,2)--(1,2)--(1,3)--(0,3)--cycle, red); | |
− | + | fill((1,2)--(2,2)--(2,3)--(1,3)--cycle, blue); | |
− | + | fill((0,1)--(1,1)--(1,2)--(0,2)--cycle, blue); | |
− | + | fill((1,1)--(2,1)--(2,2)--(1,2)--cycle, green); | |
− | + | fill((2,2)--(3,2)--(3,3)--(2,3)--cycle, red); | |
− | + | fill((2,1)--(3,1)--(3,2)--(2,2)--cycle, blue); | |
− | + | fill((2,0)--(3,0)--(3,1)--(2,1)--cycle, green); | |
− | + | fill((0,0)--(1,0)--(1,1)--(0,1)--cycle, green); | |
− | + | fill((1,0)--(2,0)--(2,1)--(1,1)--cycle, red); | |
− | + | ||
− | + | fill((6,2)--(7,2)--(7,3)--(6,3)--cycle, red); | |
− | + | fill((7,2)--(8,2)--(8,3)--(7,3)--cycle, blue); | |
− | + | fill((6,1)--(7,1)--(7,2)--(6,2)--cycle, blue); | |
− | + | fill((7,1)--(8,1)--(8,2)--(7,2)--cycle, green); | |
− | + | fill((8,2)--(9,2)--(9,3)--(8,3)--cycle, green); | |
− | + | fill((8,1)--(9,1)--(9,2)--(8,2)--cycle, red); | |
− | + | fill((8,0)--(9,0)--(9,1)--(8,1)--cycle, green); | |
− | + | fill((6,0)--(7,0)--(7,1)--(6,1)--cycle, red); | |
− | + | fill((7,0)--(8,0)--(8,1)--(7,1)--cycle, blue); | |
− | + | ||
− | + | fill((12,2)--(13,2)--(13,3)--(12,3)--cycle, red); | |
− | + | fill((13,2)--(14,2)--(14,3)--(13,3)--cycle, blue); | |
− | + | fill((12,1)--(13,1)--(13,2)--(12,2)--cycle, blue); | |
− | + | fill((13,1)--(14,1)--(14,2)--(13,2)--cycle, green); | |
− | + | fill((14,2)--(15,2)--(15,3)--(14,3)--cycle, green); | |
− | + | fill((14,1)--(15,1)--(15,2)--(14,2)--cycle, red); | |
− | + | fill((14,0)--(15,0)--(15,1)--(14,1)--cycle, blue); | |
− | + | fill((12,0)--(13,0)--(13,1)--(12,1)--cycle, green); | |
+ | fill((13,0)--(14,0)--(14,1)--(13,1)--cycle, red); | ||
+ | |||
+ | draw((0,0)--(3,0)--(3,3)--(0,3)--cycle, linewidth(1.5)); | ||
+ | draw((0,1)--(3,1), linewidth(1.5)); | ||
+ | draw((0,2)--(3,2), linewidth(1.5)); | ||
+ | draw((1,0)--(1,3), linewidth(1.5)); | ||
+ | draw((2,0)--(2,3), linewidth(1.5)); | ||
+ | |||
+ | draw((6,0)--(9,0)--(9,3)--(6,3)--cycle, linewidth(1.5)); | ||
+ | draw((6,1)--(9,1), linewidth(1.5)); | ||
+ | draw((6,2)--(9,2), linewidth(1.5)); | ||
+ | draw((7,0)--(7,3), linewidth(1.5)); | ||
+ | draw((8,0)--(8,3), linewidth(1.5)); | ||
+ | |||
+ | draw((12,0)--(15,0)--(15,3)--(12,3)--cycle, linewidth(1.5)); | ||
+ | draw((12,1)--(15,1), linewidth(1.5)); | ||
+ | draw((12,2)--(15,2), linewidth(1.5)); | ||
+ | draw((13,0)--(13,3), linewidth(1.5)); | ||
+ | draw((14,0)--(14,3), linewidth(1.5)); | ||
+ | </asy> | ||
So, Case (2) has <math>3\cdot6=18</math> ways. | So, Case (2) has <math>3\cdot6=18</math> ways. | ||
Revision as of 23:46, 6 April 2021
Contents
Problem
How many ways are there to place indistinguishable red chips, indistinguishable blue chips, and indistinguishable green chips in the squares of a grid so that no two chips of the same color are directly adjacent to each other, either vertically or horizontally?
Solution 1
Call the different colors A,B,C. There are ways to rearrange these colors to these three letters, so must be multiplied after the letters are permuted in the grid. WLOG assume that A is in the center. In this configuration, there are two cases, either all the A's lie on the same diagonal: or all the other two A's are on adjacent corners: In the first case there are two ways to order them since there are two diagonals, and in the second case there are four ways to order them since there are four pairs of adjacent corners.
In each case there is only one way to put the three B's and the three C's as shown in the diagrams. This means that there are ways to arrange A,B, and C in the grid, and there are 6 ways to rearrange the colors. Therefore, there are ways in total, which is .
-happykeeper
Solution 2 (Casework)
Without the loss of generality, we place a red ball in the top-left square. There are two cases:
Case (1): The two balls adjacent to the top-left red ball have different colors. Each placement has permutations, as there are ways to permute RBG.
There are three sub-cases for Case (1): So, Case (1) has ways.
Case (2): The two balls adjacent to the top-left red ball have the same color. Each placement has permutations, as there are ways to choose three balls consisting of exactly two colors (RBB, RGG, BRR, BGG, GRR, GBB). There are three sub-cases for Case (2): So, Case (2) has ways.
Answer
Together, the answer is
~MRENTHUSIASM
Solution 3 (Casework and Derangements)
Case (1): We have a permutation of R, B, and G as all of the rows. There are ways to rearrange these three colors. After finishing the first row, we move onto the second. Notice how the second row must be a derangement of the first one. By the derangement formula, , so there are two possible permutations of the second row. (Note: You could have also found the number of derangements of PIE). Finally, there are possible permutations for the last row. Thus, there are possibilities.
Case (2): All of the rows have two balls that are the same color and one that is different. There are obviously possible configurations for the first row, for the second, and for the third. .
Therefore, our answer is
~michaelchang1
Video Solution (Easiest)
https://www.youtube.com/watch?v=UPUrYN1YuVA ~ MathEx
Video Solution by OmegaLearn (Symmetry, Casework, and Reflections/Rotations)
https://youtu.be/wKJ9ppI-8Ew ~ pi_is_3.14
See Also
2021 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by Last Problem | |
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.