Difference between revisions of "2012 AMC 10A Problems/Problem 20"
m |
|||
| (15 intermediate revisions by 9 users not shown) | |||
| Line 1: | Line 1: | ||
{{duplicate|[[2012 AMC 12A Problems|2012 AMC 12A #15]] and [[2012 AMC 10A Problems|2012 AMC 10A #20]]}} | {{duplicate|[[2012 AMC 12A Problems|2012 AMC 12A #15]] and [[2012 AMC 10A Problems|2012 AMC 10A #20]]}} | ||
| − | ==Problem | + | ==Problem== |
A <math>3 \times 3</math> square is partitioned into <math>9</math> unit squares. Each unit square is painted either white or black with each color being equally likely, chosen independently and at random. The square is then rotated <math>90\,^{\circ}</math> clockwise about its center, and every white square in a position formerly occupied by a black square is painted black. The colors of all other squares are left unchanged. What is the probability the grid is now entirely black? | A <math>3 \times 3</math> square is partitioned into <math>9</math> unit squares. Each unit square is painted either white or black with each color being equally likely, chosen independently and at random. The square is then rotated <math>90\,^{\circ}</math> clockwise about its center, and every white square in a position formerly occupied by a black square is painted black. The colors of all other squares are left unchanged. What is the probability the grid is now entirely black? | ||
| Line 8: | Line 8: | ||
== Solution 1== | == Solution 1== | ||
| − | First, look for invariants. The center, unaffected by rotation, must be black. So automatically, the chance is less than 1 | + | First, look for invariants. The center, unaffected by rotation, must be black. So automatically, the chance is less than <math>\frac{1}{2}.</math> Note that a <math>90^{\circ}</math> rotation requires that black squares be across from each other across a vertical or horizontal axis. |
| − | As such, 2 squares directly across from each other must be black in the 4 edge squares. Since there are 2 configurations for this to be possible (top and bottom, right and left), this is a chance of | + | As such, <math>2</math> squares directly across from each other must be black in the <math>4</math> edge squares. Since there are <math>2</math> configurations for this to be possible (top and bottom, right and left), this is a chance of |
| − | <cmath>(\frac{1}{2} \cdot \frac{1}{2})+(\frac{1}{2} \cdot \frac{1}{2})=\frac{1}{2}</cmath> | + | <cmath> \left (\frac{1}{2} \cdot \frac{1}{2} \right )+ \left (\frac{1}{2} \cdot \frac{1}{2} \right )=\frac{1}{2}</cmath> |
| − | However, by PIE, subtract the chance all 4 are black and both configurations are met: <math>\frac{1}{2}-(\frac{1}{2} \cdot \frac{1}{2}) | + | However, by [[PIE]], subtract the chance all 4 are black and both configurations are met: <math>\frac{1}{2}- \left (\frac{1}{2} \cdot \frac{1}{2} \right ) \cdot \left (\frac{1}{2} \cdot \frac{1}{2} \right )=\frac{7}{16}</math>. Through symmetrical reasoning, the corners also have a <math>\frac{7}{16}</math> chance of having a configuration that yields all black corners. |
| − | Then, the chance that all squares black is the | + | Then, the chance that all squares black is the intersection of all these probabilities: <math>\frac{1}{2} \left (\frac{7}{16} \right ) \left (\frac{7}{16} \right ) = \boxed{\textbf{(A)}\ \frac{49}{512}}</math> |
| − | |||
~BJHHar | ~BJHHar | ||
| + | |||
| + | Also, if you have little to no time and are guessing, notice there are a total of <math>2^9 = 512</math> ways to permutate the colors on the square (Each square can be white or black, so there are 2 possibilities for each of the 9 squares). Thus, the answer must be in some form of <math>\frac{\text{the number of good cases}}{\text{the total number of cases}}</math>, so E is not possible. Also, since the number of good cases must be an integer, C is not possible. From there, your chances of guessing the right answer are slightly higher. ~Extremelysupercooldude | ||
== Solution 2== | == Solution 2== | ||
| − | First, there is only one way for the middle square to be black because it is not affected by the rotation. Then we can consider the corners and edges separately. Let's first just consider the number of ways we can color the corners. There is <math>1</math> case with all black squares. There are four cases with one white square and all <math>4</math> work. There are six cases with two white squares, but only the <math>2</math> with the white squares diagonal from each other | + | First, there is only one way for the middle square to be black because it is not affected by the rotation. Then we can consider the corners and edges separately. Let's first just consider the number of ways we can color the corners. There is <math>1</math> case with all-black squares. There are four cases with one white square and all <math>4</math> work. There are six cases with two white squares, but only the <math>2</math> with the white squares diagonal from each other works. There are no cases with three white squares or four white squares. Then the total number of ways to color the corners is <math>1+4+2=7</math>. In essence, the edges work the same way, so there are also <math>7</math> ways to color them. The number of ways to fit the conditions over the number of ways to color the squares is |
<cmath>\frac{7\times7}{2^9}=\boxed{\textbf{(A)}\ \frac{49}{512}}</cmath> | <cmath>\frac{7\times7}{2^9}=\boxed{\textbf{(A)}\ \frac{49}{512}}</cmath> | ||
| Line 33: | Line 34: | ||
Note that the middle square must be black because when rotated 90 degrees, it must keep its position. Now we have to deal with the following cases: <br> | Note that the middle square must be black because when rotated 90 degrees, it must keep its position. Now we have to deal with the following cases: <br> | ||
Case 1: 0 white squares. | Case 1: 0 white squares. | ||
| − | There is exactly <math> 1 </math> way to color the grid this way. <br> | + | There is exactly <math>1</math> way to color the grid this way. <br> |
Case 2: 1 white square. | Case 2: 1 white square. | ||
Note that the white square can be anywhere on the grid except for the middle square because when rotating 90 degrees it can never land on itself. Thus, there are <math>8</math> cases.<br> | Note that the white square can be anywhere on the grid except for the middle square because when rotating 90 degrees it can never land on itself. Thus, there are <math>8</math> cases.<br> | ||
Case 3: 2 white squares. | Case 3: 2 white squares. | ||
| − | We have <math>\binom{8}{2}=28</math> ways to color two white squares without restrictions (the middle square must be black, giving us 8 squares to choose from). However, we must subtract the ways | + | We have <math>\binom{8}{2}=28</math> ways to color two white squares without restrictions (the middle square must be black, giving us 8 squares to choose from). However, we must subtract the ways where two white squares differ by a rotation of 90 degrees about the middle of the square. There are a total of 8 cases we must subtract (these are not too hard to see). Thus, there are <math>20</math> ways from this.<br> |
Case 4: 3 white squares. | Case 4: 3 white squares. | ||
Since we can not change the middle square, there are <math>\binom{8}{3}=56</math> ways to color this. However, we must consider the cases where at least two squares differ by a rotation of 90 degrees. We can count this with PIE: by the Principle of Exclusion, the number of cases we want to exclude is the number of cases where 2 squares differ by a rotation of 90 degrees and minus when there are 3 squares such that two of them differ by rotation of 90 and 1 of them differs by rotation of 180, because of the overcount from our first case. | Since we can not change the middle square, there are <math>\binom{8}{3}=56</math> ways to color this. However, we must consider the cases where at least two squares differ by a rotation of 90 degrees. We can count this with PIE: by the Principle of Exclusion, the number of cases we want to exclude is the number of cases where 2 squares differ by a rotation of 90 degrees and minus when there are 3 squares such that two of them differ by rotation of 90 and 1 of them differs by rotation of 180, because of the overcount from our first case. | ||
| − | From case 2, there are 8 causes such that two squares differ by a rotation of 90. There are also 6 other places we can place the third square (it can't be the middle of the two that we already colored), for a total of 48 ways. We have to subtract the second case. Note that there are 8 ways in which we can arrange two squares differing by 180 degrees. Out of these, each one has two ways to put another square such that two differ by 90 degrees and 1 pair differs by 180. However, this is overcounted by a factor of 2, so there are | + | From case 2, there are 8 causes such that two squares differ by a rotation of 90. There are also 6 other places we can place the third square (it can't be the middle of the two that we already colored), for a total of 48 ways. We have to subtract the second case. Note that there are 8 ways in which we can arrange two squares differing by 180 degrees. Out of these, each one has two ways to put another square such that two differ by 90 degrees and 1 pair differs by 180. However, this is overcounted by a factor of 2, so there are act/2=8 ways. |
Thus, we have <math>56-(48-8)=16</math> ways in this case.<br> | Thus, we have <math>56-(48-8)=16</math> ways in this case.<br> | ||
Case 5: 4 white squares. | Case 5: 4 white squares. | ||
| − | Note that two of them have to be on one of the 4 corner squares, and two of them have to be on one of the 4 edge squares. Each solution yields two combinations, for a total of 2*2=4. | + | Note that two of them have to be on one of the 4 corner squares, and two of them have to be on one of the 4 edge squares. Each solution yields two combinations, for a total of 2 * 2 = 4. |
| − | Adding up our cases yields | + | Adding up our cases yields 1+8+20+16+4=49 ways. There are 512 ways to color the square without restrictions. Thus, the answer is <math>\boxed{\textbf{(A)}\ 49/512}</math>. |
| + | |||
| + | ==Video Solution by Pi Academy== | ||
| + | https://www.youtube.com/watch?v=uZqzC310jZM ~ Pi Academy | ||
== See Also == | == See Also == | ||
| Line 50: | Line 54: | ||
{{AMC10 box|year=2012|ab=A|num-b=19|num-a=21}} | {{AMC10 box|year=2012|ab=A|num-b=19|num-a=21}} | ||
{{AMC12 box|year=2012|ab=A|num-b=14|num-a=16}} | {{AMC12 box|year=2012|ab=A|num-b=14|num-a=16}} | ||
| + | |||
| + | [[Category: Introductory Combinatorics Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Latest revision as of 18:55, 6 October 2024
- The following problem is from both the 2012 AMC 12A #15 and 2012 AMC 10A #20, so both problems redirect to this page.
Problem
A 
square is partitioned into 
unit squares. Each unit square is painted either white or black with each color being equally likely, chosen independently and at random. The square is then rotated 
clockwise about its center, and every white square in a position formerly occupied by a black square is painted black. The colors of all other squares are left unchanged. What is the probability the grid is now entirely black?
Solution 1
First, look for invariants. The center, unaffected by rotation, must be black. So automatically, the chance is less than 
Note that a 
rotation requires that black squares be across from each other across a vertical or horizontal axis.
As such, 
squares directly across from each other must be black in the 
edge squares. Since there are configurations for this to be possible (top and bottom, right and left), this is a chance of
![\[\left (\frac{1}{2} \cdot \frac{1}{2} \right )+ \left (\frac{1}{2} \cdot \frac{1}{2} \right )=\frac{1}{2}\]](http://latex.artofproblemsolving.com/3/7/5/375c1a49a50d57948aeacba351e6497f0f1b8667.png)
However, by PIE, subtract the chance all 4 are black and both configurations are met: 
. Through symmetrical reasoning, the corners also have a 
chance of having a configuration that yields all black corners.
Then, the chance that all squares black is the intersection of all these probabilities: 
~BJHHar
Also, if you have little to no time and are guessing, notice there are a total of 
ways to permutate the colors on the square (Each square can be white or black, so there are 2 possibilities for each of the 9 squares). Thus, the answer must be in some form of 
, so E is not possible. Also, since the number of good cases must be an integer, C is not possible. From there, your chances of guessing the right answer are slightly higher. ~Extremelysupercooldude
Solution 2
First, there is only one way for the middle square to be black because it is not affected by the rotation. Then we can consider the corners and edges separately. Let's first just consider the number of ways we can color the corners. There is 
case with all-black squares. There are four cases with one white square and all work. There are six cases with two white squares, but only the with the white squares diagonal from each other works. There are no cases with three white squares or four white squares. Then the total number of ways to color the corners is 
. In essence, the edges work the same way, so there are also 
ways to color them. The number of ways to fit the conditions over the number of ways to color the squares is
![\[\frac{7\times7}{2^9}=\boxed{\textbf{(A)}\ \frac{49}{512}}\]](http://latex.artofproblemsolving.com/d/1/2/d12be61744c1adb4e336be847dcbf4e9a9ea7d06.png)
Solution 3
We proceed by casework.
Note that the middle square must be black because when rotated 90 degrees, it must keep its position. Now we have to deal with the following cases:
Case 1: 0 white squares.
There is exactly way to color the grid this way.
Case 2: 1 white square.
Note that the white square can be anywhere on the grid except for the middle square because when rotating 90 degrees it can never land on itself. Thus, there are 
cases.
Case 3: 2 white squares.
We have 
ways to color two white squares without restrictions (the middle square must be black, giving us 8 squares to choose from). However, we must subtract the ways where two white squares differ by a rotation of 90 degrees about the middle of the square. There are a total of 8 cases we must subtract (these are not too hard to see). Thus, there are 
ways from this.
Case 4: 3 white squares.
Since we can not change the middle square, there are 
ways to color this. However, we must consider the cases where at least two squares differ by a rotation of 90 degrees. We can count this with PIE: by the Principle of Exclusion, the number of cases we want to exclude is the number of cases where 2 squares differ by a rotation of 90 degrees and minus when there are 3 squares such that two of them differ by rotation of 90 and 1 of them differs by rotation of 180, because of the overcount from our first case.
From case 2, there are 8 causes such that two squares differ by a rotation of 90. There are also 6 other places we can place the third square (it can't be the middle of the two that we already colored), for a total of 48 ways. We have to subtract the second case. Note that there are 8 ways in which we can arrange two squares differing by 180 degrees. Out of these, each one has two ways to put another square such that two differ by 90 degrees and 1 pair differs by 180. However, this is overcounted by a factor of 2, so there are act/2=8 ways.
Thus, we have 
ways in this case.
Case 5: 4 white squares.
Note that two of them have to be on one of the 4 corner squares, and two of them have to be on one of the 4 edge squares. Each solution yields two combinations, for a total of 2 * 2 = 4.
Adding up our cases yields 1+8+20+16+4=49 ways. There are 512 ways to color the square without restrictions. Thus, the answer is 
.
Video Solution by Pi Academy
https://www.youtube.com/watch?v=uZqzC310jZM ~ Pi Academy
See Also
| 2012 AMC 10A (Problems • Answer Key • Resources) | ||
| Preceded by Problem 19 |
Followed by Problem 21 | |
| 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 | ||
| 2012 AMC 12A (Problems • Answer Key • Resources) | |
| Preceded by Problem 14 |
Followed by Problem 16 |
| 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. 
