Difference between revisions of "2024 AMC 8 Problems/Problem 7"
m (→Problem) |
|||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | |||
A <math>3</math>x<math>7</math> rectangle is covered without overlap by 3 shapes of tiles: <math>2</math>x<math>2</math>, <math>1</math>x<math>4</math>, and <math>1</math>x<math>1</math>, shown below. What is the minimum possible number of <math>1</math>x<math>1</math> tiles used? | A <math>3</math>x<math>7</math> rectangle is covered without overlap by 3 shapes of tiles: <math>2</math>x<math>2</math>, <math>1</math>x<math>4</math>, and <math>1</math>x<math>1</math>, shown below. What is the minimum possible number of <math>1</math>x<math>1</math> tiles used? | ||
| − | + | <math>\textbf{(A) } 1\qquad\textbf{(B)} 2\qquad\textbf{(C) } 3\qquad\textbf{(D) } 4\qquad\textbf{(E) } 5</math> | |
| − | (A) | ||
==Solution 1== | ==Solution 1== | ||
Revision as of 13:17, 26 January 2024
Problem
A 
x
rectangle is covered without overlap by 3 shapes of tiles: 
x, 
x
, and x, shown below. What is the minimum possible number of x tiles used?
Solution 1
We can eliminate B, C, and D, because they are not 
any multiple of . Finally, we see that there is no way to have A, so the solution is 
.
Solution 2
Let 
be the number of 
tiles. There are 
squares and each 
or 
tile takes up 4 squares, so 
, so it is either or 
. Color the columns, starting with red, then blue, and alternating colors, ending with a red column. There are 
red squares and 
blue squares, but each and shape takes up an equal number of blue and red squares, so there must be more tiles on red squares than on blue squares, which is impossible if there is just one, so the answer is 
, which can easily be confirmed to work
~arfekete
