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

(Video Solution 2 by OmegaLearn.org)
(Problem)
Line 1: Line 1:
 
==Problem==
 
==Problem==
Rodrigo is drawing lines on the coordinate plane, and counting how many unit squares they go through. He draws a line with endpoints <math>(2000,3000)</math> and <math>(5000,8000).</math> How many unit squares does this segment go through?
+
Rodrigo has a very large sheet of graph paper. First he draws a line segment connecting point <math>(0,4)</math> to point <math>(2,0)</math> and colors the <math>4</math> cells whose interiors intersect the segment, as shown below. Next Rodrigo draws a line segment connecting point <math>(2000,3000)</math> to point <math>(5000,8000)</math>. How many cells will he color this time?
 +
 
 +
<asy>
 +
 
 +
draw((-1,5)--(-1,-1),gray(.8));
 +
draw((0,5)--(0,-1),gray(.8));
 +
draw((1,5)--(1,-1),gray(.8));
 +
draw((2,5)--(2,-1),gray(.8));
 +
draw((3,5)--(3,-1),gray(.8));
 +
draw((4,5)--(4,-1),gray(.8));
 +
draw((5,5)--(5,-1),gray(.8));
 +
 
 +
draw((-1,5)--(5, 5),gray(.8));
 +
draw((-1,4)--(5,4),gray(.8));
 +
draw((-1,3)--(5,3),gray(.8));
 +
draw((-1,2)--(5,2),gray(.8));
 +
draw((-1,1)--(5,1),gray(.8));
 +
draw((-1,0)--(5,0),gray(.8));
 +
draw((-1,-1)--(5,-1),gray(.8));
 +
 
 +
 
 +
dot((0,4));
 +
label("$(0,4)$",(0,4),NW);
 +
 
 +
dot((2,0));
 +
label("$(2,0)$",(2,0),SE);
 +
 
 +
draw((0,4)--(2,0));
 +
 
 +
draw((-1,0) -- (5,0), arrow=Arrow);
 +
draw((0,-1) -- (0,5), arrow=Arrow);
 +
 
 +
filldraw((0,4)--(1,4)--(1,3)--(0,3)--cycle--black);
 +
filldraw((0,3)--(1,3)--(1,2)--(0,2)--cycle--black);
 +
 
 +
 
 +
 
 +
</asy>
  
 
==Solution 1==
 
==Solution 1==

Revision as of 14:12, 26 January 2024

Problem

Rodrigo has a very large sheet of graph paper. First he draws a line segment connecting point $(0,4)$ to point $(2,0)$ and colors the $4$ cells whose interiors intersect the segment, as shown below. Next Rodrigo draws a line segment connecting point $(2000,3000)$ to point $(5000,8000)$. How many cells will he color this time?


draw((-1,5)--(-1,-1),gray(.8));
draw((0,5)--(0,-1),gray(.8));
draw((1,5)--(1,-1),gray(.8));
draw((2,5)--(2,-1),gray(.8));
draw((3,5)--(3,-1),gray(.8));
draw((4,5)--(4,-1),gray(.8));
draw((5,5)--(5,-1),gray(.8));

draw((-1,5)--(5, 5),gray(.8));
draw((-1,4)--(5,4),gray(.8));
draw((-1,3)--(5,3),gray(.8));
draw((-1,2)--(5,2),gray(.8));
draw((-1,1)--(5,1),gray(.8));
draw((-1,0)--(5,0),gray(.8));
draw((-1,-1)--(5,-1),gray(.8));


dot((0,4));
label("$(0,4)$",(0,4),NW);

dot((2,0));
label("$(2,0)$",(2,0),SE);

draw((0,4)--(2,0));

draw((-1,0) -- (5,0), arrow=Arrow);
draw((0,-1) -- (0,5), arrow=Arrow);

filldraw((0,4)--(1,4)--(1,3)--(0,3)--cycle--black);
filldraw((0,3)--(1,3)--(1,2)--(0,2)--cycle--black);



 (Error making remote request. Unknown error_msg)

Solution 1

Let $f(x, y)$ be the number of cells the line segment from $(0, 0)$ to $(x, y)$ passes through. The problem is then equivalent to finding \[f(5000-2000, 8000-3000)=f(3000, 5000).\] Sometimes the segment passes through lattice points in between the endpoints, which happens $\text{gcd}(3000, 5000)-1=999$ times. This partitions the segment into $1000$ congruent pieces that pass through $f(3, 5)$ cells, which means the answer is \[1000f(3, 5).\] Note that a new square is entered when the lines pass through one of the lines in the coordinate grid, which for $f(3, 5)$ happens $3-1+5-1=6$ times. Because $3$ and $5$ are relatively prime, no lattice point except for the endpoints intersects the line segment from $(0, 0)$ to $(3, 5).$ This means that including the first cell closest to $(0, 0),$ The segment passes through $f(3, 5)=6+1=7$ cells. Thus, the answer is $\boxed{7000}.$ Alternatively, $f(3, 5)$ can be found by drawing an accurate diagram, leaving you with the same answer.

~BS2012

Video Solution 1 by Math-X (First fully understand the problem!!!)

https://www.youtube.com/watch?v=dqqAk-Cd_5M

~Math-X

Video Solution 2 by OmegaLearn.org

https://youtu.be/wNymnFQfN_k

Video Solution by SpreadTheMathLove

https://www.youtube.com/watch?v=x8Zo7QOB-us