Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2023 AMC 12B Problems/Problem 5

Revision as of 19:41, 15 November 2023 by Bowenna (talk | contribs)
The following problem is from both the 2023 AMC 10B #10 and 2023 AMC 12B #5, so both problems redirect to this page.

Problem

You are playing a game. A $2 \times 1$ rectangle covers two adjacent squares (oriented either horizontally or vertically) of a $3 \times 3$ grid of squares, but you are not told which two squares are covered. Your goal is to find at least one square that is covered by the rectangle. A "turn" consists of you guessing a square, after which you are told whether that square is covered by the hidden rectangle. What is the minimum number of turns you need to ensure that at least one of your guessed squares is covered by the rectangle?

$\textbf{(A)}~3\qquad\textbf{(B)}~5\qquad\textbf{(C)}~4\qquad\textbf{(D)}~8\qquad\textbf{(E)}~6$

Solution 1

First, we notice that there are a total of $12 \text{ } 2\times1$ rectangles in a $3\times3$ grid.

Next, if we choose one of the corners, and the corner is not covered by a $2 \times 1$ rectangle, we can eliminate a maximum of 2 rectangles. [asy] draw((0,0)--(3,0)); draw((3,0)--(3,3)); draw((3,3)--(0,3)); draw((0,3)--(0,0)); draw((1,0)--(1,3)); draw((2,0)--(2,3)); draw((0,1)--(3,1)); draw((0,2)--(3,2)); [/asy]

If we choose one of the side squares, we can eliminate a maximum of $3$ rectangles.

Finally, if we choose the center square, we can eliminate a maximum of $4$ rectangles, but doing so means that if we choose a side square, we only eliminate 2 rectangles.

The answer is $\boxed{(C) 4}$

Solution 2

First, note that since the rectangle covers 2 squares, we only need to guess squares that are not adjacent to any of our other guesses. To minimize the amount of guesses, each of our guessed squares should try to touch another guess on one vertex and one vertex only. There are only two ways to do this: one with $5$ guesses, and one with $4$. Since the problem is asking for the minimum number, the answer is $\boxed{\text{(C) } 4}$.

~yourmomisalosinggame (a.k.a. Aaron)

Solution 3

Since the hidden rectangle can only hide two adjacent squares, we may think that we eliminate 8 squares and we're done, but think again. This is the AMC 10, so there must be a better solution (also note that every other solution choice is below 8 so we're probably not done) So, we think again, we notice that we haven't used the adjacent condition, and then it clicks. If we eliminate the four squares with only one edge on the boundary of the 9x9 square. We are left with 5 diagonal squares, since our rectangle cant be diagonal, we can ensure that we find it in 4 moves. So our answer is : $\boxed{\text{(C) } 4}$

~arrowskyknight22

See Also

2023 AMC 10B (Problems • Answer Key • Resources)
Preceded by
Problem 9 		Followed by
Problem 11
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions
2023 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 4 		Followed by
Problem 6
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2023_AMC_12B_Problems/Problem_5&oldid=203564"