Difference between revisions of "2023 AMC 10A Problems/Problem 20"
Technodoggo (talk | contribs) |
Technodoggo (talk | contribs) |
||
| Line 1: | Line 1: | ||
Each square in a <math>3\times3</math> grid of squares is colored red, white, blue, or green so that every <math>2\times2</math> square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible? | Each square in a <math>3\times3</math> grid of squares is colored red, white, blue, or green so that every <math>2\times2</math> square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible? | ||
| + | |||
| + | [[Image:2023_10a_20.png]] | ||
==Solution 1== | ==Solution 1== | ||
Revision as of 20:31, 9 November 2023
Each square in a 
grid of squares is colored red, white, blue, or green so that every 
square contains one square of each color. One such coloring is shown on the right below. How many different colorings are possible?
Solution 1
Let a "tile" denote a 
square and "square" refer to .
We first have 
possible ways to fill out the top left square. We then fill out the bottom right tile. In the bottom right square, we already have one corner filled out (from our initial coloring), and we now have 
options left to pick from.
We then look at the right middle tile. It is part of two squares: the top right and top left. Among these squares, colors have already been used, so we only have one more option for it. Similarly, every other square only has one more option, so we have a total of 
ways.
~Technodoggo
