Difference between revisions of "2024 AMC 8 Problems/Problem 7"

(Solution 2)
(Solution 2)
Line 12: Line 12:
 
==Solution 2==
 
==Solution 2==
 
Let <math>x</math> be the number of <math>1x1</math> tiles. There are <math>21</math> squares and each <math>2x2</math> or <math>1x4</math> tile takes up 4 squares, so <math>x \equiv 1 \pmod{4}</math>, so it is either <math>1</math> or <math>5</math>. Color the columns, starting with red, then blue, and alternating colors, ending with a red column. There are <math>12</math> red squares and <math>9</math> blue squares, but each <math>2x2</math> and <math>1x4</math> shape takes up an equal number of blue and red squares, so there must be <math>3</math> more <math>1x1</math> tiles on red squares than on blue squares, which is impossible if there is just one, so the answer is <math>\boxed{\textbf{(E)\ 5}}</math>, which can easily be confirmed to work
 
Let <math>x</math> be the number of <math>1x1</math> tiles. There are <math>21</math> squares and each <math>2x2</math> or <math>1x4</math> tile takes up 4 squares, so <math>x \equiv 1 \pmod{4}</math>, so it is either <math>1</math> or <math>5</math>. Color the columns, starting with red, then blue, and alternating colors, ending with a red column. There are <math>12</math> red squares and <math>9</math> blue squares, but each <math>2x2</math> and <math>1x4</math> shape takes up an equal number of blue and red squares, so there must be <math>3</math> more <math>1x1</math> tiles on red squares than on blue squares, which is impossible if there is just one, so the answer is <math>\boxed{\textbf{(E)\ 5}}</math>, which can easily be confirmed to work
 +
 +
~arfekete
  
 
==Video Solution 1(easy to digest) by Power Solve==
 
==Video Solution 1(easy to digest) by Power Solve==
 
https://youtu.be/16YYti_pDUg?si=KjRhUdCOAx10kgiW&t=59
 
https://youtu.be/16YYti_pDUg?si=KjRhUdCOAx10kgiW&t=59

Revision as of 16:28, 25 January 2024

Problem

A $3$x$7$ rectangle is covered without overlap by 3 shapes of tiles: $2$x$2$, $1$x$4$, and $1$x$1$, shown below. What is the minimum possible number of $1$x$1$ tiles used?


(A) $1$ (B) $2$ (C) $3$ (D) $4$ (E) $5$

Solution 1

We can eliminate B, C, and D, because they are not $21-$ any multiple of $4$. Finally, we see that there is no way to have A, so the solution is $(E) \boxed{5}$.

Solution 2

Let $x$ be the number of $1x1$ tiles. There are $21$ squares and each $2x2$ or $1x4$ tile takes up 4 squares, so $x \equiv 1 \pmod{4}$, so it is either $1$ or $5$. Color the columns, starting with red, then blue, and alternating colors, ending with a red column. There are $12$ red squares and $9$ blue squares, but each $2x2$ and $1x4$ shape takes up an equal number of blue and red squares, so there must be $3$ more $1x1$ tiles on red squares than on blue squares, which is impossible if there is just one, so the answer is $\boxed{\textbf{(E)\ 5}}$, which can easily be confirmed to work

~arfekete

Video Solution 1(easy to digest) by Power Solve

https://youtu.be/16YYti_pDUg?si=KjRhUdCOAx10kgiW&t=59