Difference between revisions of "2018 AMC 10A Problems/Problem 20"
Qianqian07 (talk | contribs) m (→Solution 4) |
|||
(19 intermediate revisions by 11 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{duplicate|[[2018 AMC 12A Problems|2018 AMC 12A #15]] and [[2018 AMC 10A Problems|2018 AMC 10A #20]]}} | ||
+ | |||
+ | ==Problem== | ||
+ | |||
A scanning code consists of a <math>7 \times 7</math> grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of <math>49</math> squares. A scanning code is called <math>\textit{symmetric}</math> if its look does not change when the entire square is rotated by a multiple of <math>90 ^{\circ}</math> counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes? | A scanning code consists of a <math>7 \times 7</math> grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of <math>49</math> squares. A scanning code is called <math>\textit{symmetric}</math> if its look does not change when the entire square is rotated by a multiple of <math>90 ^{\circ}</math> counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes? | ||
<math>\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}</math> | <math>\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}</math> | ||
− | |||
==Solution 1== | ==Solution 1== | ||
Draw a <math>7 \times 7</math> square. | Draw a <math>7 \times 7</math> square. | ||
− | < | + | <cmath> \begin{tabular}{|c|c|c|c|c|c|c|} |
\hline | \hline | ||
K & J & H & G & H & J & K \\ | K & J & H & G & H & J & K \\ | ||
Line 23: | Line 26: | ||
K & J & H & G & H & J & K \\ | K & J & H & G & H & J & K \\ | ||
\hline | \hline | ||
− | \end{tabular} </ | + | \end{tabular} </cmath> |
Start from the center and label all protruding cells symmetrically. (Note that "I" is left out of this labelling, so there are only 10 labels, not 11, as ending in K would suggest!) | Start from the center and label all protruding cells symmetrically. (Note that "I" is left out of this labelling, so there are only 10 labels, not 11, as ending in K would suggest!) | ||
− | More specifically, since there are <math>4</math> given lines of symmetry (<math>2</math> diagonals, <math>1</math> vertical, <math>1</math> horizontal) and they split the plot into <math>8</math> equivalent sections, we can take just one-eighth and study it in particular. Each of these sections has <math>10</math> distinct sub-squares, whether partially or in full. So since each can be colored either white or black, we choose <math>2^{10}=1024</math> but then subtract the <math>2</math> cases where all are white or all are black. That leaves us with <math>\ | + | More specifically, since there are <math>4</math> given lines of symmetry (<math>2</math> diagonals, <math>1</math> vertical, <math>1</math> horizontal) and they split the plot into <math>8</math> equivalent sections, we can take just one-eighth and study it in particular. Each of these sections has <math>10</math> distinct sub-squares, whether partially or in full. So since each can be colored either white or black, we choose <math>2^{10}=1024</math> but then subtract the <math>2</math> cases where all are white or all are black. That leaves us with <math>\fbox{\textbf{(B)} \text{ 1022}}</math>. |
− | There are only ten squares we get to actually choose, and two independent choices for each, for a total of <math>2^{10} = 1024</math> codes. Two codes must be subtracted (due to the rule that there must be at least one square of each color) for an answer of <math>\fbox{\textbf{(B)} | + | There are only ten squares we get to actually choose, and two independent choices for each, for a total of <math>2^{10} = 1024</math> codes. Two codes must be subtracted (due to the rule that there must be at least one square of each color) for an answer of <math>\fbox{\textbf{(B) }1022}</math>. |
− | |||
− | Note that this problem is very similar to the 1996 AIME Problem 7. | + | Note that this problem is very similar to the 1996 AIME Problem 7 https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_7. |
==Solution 2== | ==Solution 2== | ||
Line 53: | Line 55: | ||
==Solution 3== | ==Solution 3== | ||
− | This <math>7 \times 7</math> square drawn in | + | This <math>7 \times 7</math> square drawn in Solution 1 satisfies the conditions given in the problem. Calculating the number of ways of coloring it will solve the problem. |
− | < | + | <cmath> \begin{tabular}{|c|c|c|c|c|c|c|} |
\hline | \hline | ||
K & J & H & G & H & J & K \\ | K & J & H & G & H & J & K \\ | ||
Line 71: | Line 73: | ||
K & J & H & G & H & J & K \\ | K & J & H & G & H & J & K \\ | ||
\hline | \hline | ||
− | \end{tabular} </ | + | \end{tabular} </cmath> |
In the grid, 10 letters are used: <math>A</math>, <math>B</math>, <math>C</math>, <math>D</math>, <math>E</math>, <math>F</math>, <math>G</math>, <math>H</math>, <math>J</math>, and <math>K</math>. Each of the letters must have its own color, either white or black. This means, for example, all <math>K</math>'s must have the same color for the grid to be symmetrical. | In the grid, 10 letters are used: <math>A</math>, <math>B</math>, <math>C</math>, <math>D</math>, <math>E</math>, <math>F</math>, <math>G</math>, <math>H</math>, <math>J</math>, and <math>K</math>. Each of the letters must have its own color, either white or black. This means, for example, all <math>K</math>'s must have the same color for the grid to be symmetrical. | ||
Line 77: | Line 79: | ||
So there are <math>2^{10}</math> ways to color the grid, including a completely black grid and a completely white grid. Since the grid must contain at least one square with each color, the number of ways is <math>2^{10}-2=1024-2=</math> <math>\boxed{\textbf{(B) } 1022}</math>. | So there are <math>2^{10}</math> ways to color the grid, including a completely black grid and a completely white grid. Since the grid must contain at least one square with each color, the number of ways is <math>2^{10}-2=1024-2=</math> <math>\boxed{\textbf{(B) } 1022}</math>. | ||
− | + | ==Solution 4== | |
+ | |||
+ | <cmath> \begin{tabular}{|c|c|c|c|c|c|c|} | ||
+ | \hline | ||
+ | T & T & T & X & T & T & T \\ | ||
+ | \hline | ||
+ | T & T & T & Y& T & T & T \\ | ||
+ | \hline | ||
+ | T & T & T & Z & T & T & T \\ | ||
+ | \hline | ||
+ | X & Y & Z & W & Z & Y & X \\ | ||
+ | \hline | ||
+ | T & T & T & Z & T & T & T \\ | ||
+ | \hline | ||
+ | T & T & T & Y & T & T & T \\ | ||
+ | \hline | ||
+ | T & T & T & X & T & T & T \\ | ||
+ | \hline | ||
+ | \end{tabular} </cmath> | ||
+ | |||
+ | There are <math>3 \times 3</math> squares in the corners of this <math>7 \times 7</math> square, and there is a horizontal and vertical stripe through the middle. Because we need to have symmetry when the diagonals and midpoints of the large square is connected, we can create a table like this: (Different letters represent different color choices between black and white) | ||
+ | |||
+ | <cmath> \begin{tabular}{|c|c|c|} | ||
+ | \hline | ||
+ | A & B & C \\ | ||
+ | \hline | ||
+ | B & D & E \\ | ||
+ | \hline | ||
+ | C & E & F \\ | ||
+ | \hline | ||
+ | \end{tabular}</cmath> | ||
+ | (Note that coloring one <math>3 \times 3</math> square will also determine the colorings of the other <math>3</math> because the large <math>7 \times 7</math> square must look the same when it is rotated by <math>90^\circ</math>) | ||
+ | |||
+ | There are <math>6</math> different letters and <math>2</math> choices of color (black and white) for each letter, so there are <math>2^6=64</math> colorings of a proper <math>3 \times 3</math> square. Now, all that's left are the horizontal and vertical stripes. Using similar logic, we can see that there are <math>4</math> different letters, so there are <math>2^4=16</math> different colorings. Multiplying them together gives <math>16 \times 64 = 1024</math>. Going back to the question, we see that "there must be at least one square of each color in this grid of <math>49</math> squares." We must then eliminate <math>2</math> options: an all-black grid and an all-white grid. <math>1024-2= \boxed{\textbf{(B)} 1022} \\ \phantom{}</math> | ||
+ | -hansenhe | ||
+ | |||
+ | ==Video Solution== | ||
+ | https://youtu.be/M22S82Am2zM | ||
+ | |||
== See Also == | == See Also == | ||
{{AMC10 box|year=2018|ab=A|num-b=19|num-a=21}} | {{AMC10 box|year=2018|ab=A|num-b=19|num-a=21}} | ||
− | {{AMC12 box|year=2018|ab=|num-b=14|num-a=16}} | + | {{AMC12 box|year=2018|ab=A|num-b=14|num-a=16}} |
{{MAA Notice}} | {{MAA Notice}} | ||
[[Category:Intermediate Combinatorics Problems]] | [[Category:Intermediate Combinatorics Problems]] |
Latest revision as of 22:48, 2 August 2021
- The following problem is from both the 2018 AMC 12A #15 and 2018 AMC 10A #20, so both problems redirect to this page.
Problem
A scanning code consists of a grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of squares. A scanning code is called if its look does not change when the entire square is rotated by a multiple of counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes?
Solution 1
Draw a square.
Start from the center and label all protruding cells symmetrically. (Note that "I" is left out of this labelling, so there are only 10 labels, not 11, as ending in K would suggest!)
More specifically, since there are given lines of symmetry ( diagonals, vertical, horizontal) and they split the plot into equivalent sections, we can take just one-eighth and study it in particular. Each of these sections has distinct sub-squares, whether partially or in full. So since each can be colored either white or black, we choose but then subtract the cases where all are white or all are black. That leaves us with .
There are only ten squares we get to actually choose, and two independent choices for each, for a total of codes. Two codes must be subtracted (due to the rule that there must be at least one square of each color) for an answer of .
Note that this problem is very similar to the 1996 AIME Problem 7 https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_7.
Solution 2
Imagine folding the scanning code along its lines of symmetry. There will be regions which you have control over coloring. Since we must subtract off cases for the all-black and all-white cases, the answer is
Solution 3
This square drawn in Solution 1 satisfies the conditions given in the problem. Calculating the number of ways of coloring it will solve the problem.
In the grid, 10 letters are used: , , , , , , , , , and . Each of the letters must have its own color, either white or black. This means, for example, all 's must have the same color for the grid to be symmetrical.
So there are ways to color the grid, including a completely black grid and a completely white grid. Since the grid must contain at least one square with each color, the number of ways is .
Solution 4
There are squares in the corners of this square, and there is a horizontal and vertical stripe through the middle. Because we need to have symmetry when the diagonals and midpoints of the large square is connected, we can create a table like this: (Different letters represent different color choices between black and white)
(Note that coloring one square will also determine the colorings of the other because the large square must look the same when it is rotated by )
There are different letters and choices of color (black and white) for each letter, so there are colorings of a proper square. Now, all that's left are the horizontal and vertical stripes. Using similar logic, we can see that there are different letters, so there are different colorings. Multiplying them together gives . Going back to the question, we see that "there must be at least one square of each color in this grid of squares." We must then eliminate options: an all-black grid and an all-white grid. -hansenhe
Video Solution
See Also
2018 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 |
2018 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.