Difference between revisions of "2024 AMC 8 Problems/Problem 7"
(→Problem) |
(→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | A <math> | + | 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) < | + | (A) <math>1</math> (B) <math>2</math> (C) <math>3</math> (D) <math>4</math> (E) <math>5</math> |
==Solution 1== | ==Solution 1== | ||
Revision as of 17:11, 25 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?
(A) (B) (C) (D) (E) 
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 
.
