Browse · harp
Printjmc
counting and probability junior
Problem
A rectangle is covered without overlap by 3 shapes of tiles: , , and , shown below. What is the minimum possible number of tiles used?
(A)
(B)
(C)
(D)
(E)
Solution
We can eliminate B, C, and D, because they are not subtracted by any multiple of . Finally, we see that there is no way to have A, so the solution is .
Final answer
E