2024 AMC 8 Problems/Problem 7
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?
\textbf{(A) } 1\qquad\textbf{(B) } 2\qquad\textbf{(C) } 3\qquad\textbf{(D) } 4\qquad\textbf{(E) } 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
.