2024 AMC 8 Problems/Problem 7: Difference between revisions
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
A <math>3x7</math> rectangle is covered without overlap by 3 shapes of tiles: <math>2x2</math>, <math>1x4</math>, and <math>1x1</math>, shown below. What is the minimum possible number of | A <math>3x7</math> rectangle is covered without overlap by 3 shapes of tiles: <math>2x2</math>, <math>1x4</math>, and <math>1x1</math>, shown below. What is the minimum possible number of <math>1x1 tiles used? | ||
(A) </math>1<math> (B) </math>2<math> (C) </math>3<math> (D) </math>4<math> (E) </math>5$ | |||
==Solution 1== | ==Solution 1== | ||
Revision as of 16:10, 25 January 2024
Problem
A 
rectangle is covered without overlap by 3 shapes of tiles: 
, 
, and 
, shown below. What is the minimum possible number of $1x1 tiles used?
(A)$ (Error compiling LaTeX. Unknown error_msg)1
2
3
4
5$
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 
.
