Difference between revisions of "2018 AMC 10A Problems/Problem 16"
Elements2015 (talk | contribs) (→Solution) |
Pi is 3.14 (talk | contribs) (→Video Solution 2) |
||
(31 intermediate revisions by 13 users not shown) | |||
Line 1: | Line 1: | ||
+ | ==Problem== | ||
+ | |||
Right triangle <math>ABC</math> has leg lengths <math>AB=20</math> and <math>BC=21</math>. Including <math>\overline{AB}</math> and <math>\overline{BC}</math>, how many line segments with integer length can be drawn from vertex <math>B</math> to a point on hypotenuse <math>\overline{AC}</math>? | Right triangle <math>ABC</math> has leg lengths <math>AB=20</math> and <math>BC=21</math>. Including <math>\overline{AB}</math> and <math>\overline{BC}</math>, how many line segments with integer length can be drawn from vertex <math>B</math> to a point on hypotenuse <math>\overline{AC}</math>? | ||
Line 9: | Line 11: | ||
</math> | </math> | ||
− | ==Solution== | + | ==Solution 1== |
+ | |||
<asy> | <asy> | ||
− | unitsize( | + | unitsize(4); |
pair A, B, C, E, P; | pair A, B, C, E, P; | ||
A=(-20, 0); | A=(-20, 0); | ||
Line 23: | Line 26: | ||
dot("$B$", B, SE); | dot("$B$", B, SE); | ||
dot("$C$", C, NE); | dot("$C$", C, NE); | ||
− | dot("$P$", P, | + | dot("$P$", P, NW); |
</asy> | </asy> | ||
+ | |||
As the problem has no diagram, we draw a diagram. The hypotenuse has length <math>29</math>. Let <math>P</math> be the foot of the altitude from <math>B</math> to <math>AC</math>. Note that <math>BP</math> is the shortest possible length of any segment. Writing the area of the triangle in two ways, we can solve for <math>BP=\dfrac{20\cdot 21}{29}</math>, which is between <math>14</math> and <math>15</math>. | As the problem has no diagram, we draw a diagram. The hypotenuse has length <math>29</math>. Let <math>P</math> be the foot of the altitude from <math>B</math> to <math>AC</math>. Note that <math>BP</math> is the shortest possible length of any segment. Writing the area of the triangle in two ways, we can solve for <math>BP=\dfrac{20\cdot 21}{29}</math>, which is between <math>14</math> and <math>15</math>. | ||
− | Let the line segment be <math>BX</math>, with <math>X</math> on <math>AC</math>. As you move <math>X</math> along the hypotenuse from <math>A</math> to <math>P</math>, the length of <math>BX</math> strictly decreases, hitting all the integer values from <math>20, 19, \dots 15</math> (IVT). Similarly, moving <math>X</math> from <math>P</math> to <math>C</math> hits all the integer values from <math>15, 16, \dots, 21</math>. This is a total of <math>\boxed{(D) 13}</math> line segments. | + | Let the line segment be <math>BX</math>, with <math>X</math> on <math>AC</math>. As you move <math>X</math> along the hypotenuse from <math>A</math> to <math>P</math>, the length of <math>BX</math> strictly decreases, hitting all the integer values from <math>20, 19, \dots 15</math> (IVT). Similarly, moving <math>X</math> from <math>P</math> to <math>C</math> hits all the integer values from <math>15, 16, \dots, 21</math>. This is a total of <math>\boxed{(D) 13}</math> distinct line segments. |
(asymptote diagram added by elements2015) | (asymptote diagram added by elements2015) | ||
+ | |||
+ | ==Solution 2 - Circles== | ||
+ | Note that if a circle with an integer radius <math>r</math> centered at vertex <math>B</math> intersects hypotenuse <math>\overline{AB}</math>, the lines drawn from <math>B</math> to the points of intersection are integer lengths. As in the previous solution, the shortest distance <math>14<\overline{BP}<15</math>. As a result, a circle of <math>14</math> will <b>not</b> reach the hypotenuse and thus does not intersect it. We also know that a circle of radius <math>21</math> intersects the hypotenuse once and a circle of radius <math>\{15, 16, 17, 18, 19, 20 \}</math> intersects the hypotenuse twice. Quick graphical thinking or Euclidean construction will prove this. | ||
+ | |||
+ | <asy> | ||
+ | unitsize(4); | ||
+ | pair A, B, C, E, P; | ||
+ | A=(-20, 0); | ||
+ | B=origin; | ||
+ | C=(0,21); | ||
+ | E=(-21, 20); | ||
+ | P=extension(B,E, A, C); | ||
+ | draw(A--B--C--cycle); | ||
+ | draw(B--P); | ||
+ | dot("$A$", A, SW); | ||
+ | dot("$B$", B, SE); | ||
+ | dot("$C$", C, NE); | ||
+ | dot("$P$", P, S); | ||
+ | draw(arc((0,0),21, 90, 180)); | ||
+ | draw(arc((0,0),20, 90, 180)); | ||
+ | draw(arc((0,0),19, 90, 180)); | ||
+ | draw(arc((0,0),18, 90, 180)); | ||
+ | draw(arc((0,0),17, 90, 180)); | ||
+ | draw(arc((0,0),16, 90, 180)); | ||
+ | draw(arc((0,0),15, 90, 180)); | ||
+ | </asy> | ||
+ | |||
+ | It follows that we can draw circles of radii <math>15, 16, 17, 18, 19,</math> and <math>20,</math> that each contribute <b>two</b> integer lengths (since these circles intersect the hypotenuse twice) from <math>B</math> to <math>\overline{AC}</math> and one circle of radius <math>21</math> that contributes only one such segment. Our answer is then <cmath>6 \cdot 2 + 1 = 13 \implies \boxed{D}</cmath> ~samrocksnature | ||
+ | |||
+ | ==Video Solution 1(The Beauty of Math)== | ||
+ | https://youtu.be/M22S82Am2zM | ||
+ | |||
+ | ~IceMatrix | ||
+ | |||
+ | == Video Solution 2 by OmegaLearn == | ||
+ | https://youtu.be/4_x1sgcQCp4?t=3790 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
==See Also== | ==See Also== | ||
Line 34: | Line 76: | ||
{{AMC10 box|year=2018|ab=A|num-b=15|num-a=17}} | {{AMC10 box|year=2018|ab=A|num-b=15|num-a=17}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
+ | |||
+ | [[Category:Introductory Geometry Problems]] |
Latest revision as of 03:32, 23 January 2023
Contents
Problem
Right triangle has leg lengths
and
. Including
and
, how many line segments with integer length can be drawn from vertex
to a point on hypotenuse
?
Solution 1
As the problem has no diagram, we draw a diagram. The hypotenuse has length . Let
be the foot of the altitude from
to
. Note that
is the shortest possible length of any segment. Writing the area of the triangle in two ways, we can solve for
, which is between
and
.
Let the line segment be , with
on
. As you move
along the hypotenuse from
to
, the length of
strictly decreases, hitting all the integer values from
(IVT). Similarly, moving
from
to
hits all the integer values from
. This is a total of
distinct line segments.
(asymptote diagram added by elements2015)
Solution 2 - Circles
Note that if a circle with an integer radius centered at vertex
intersects hypotenuse
, the lines drawn from
to the points of intersection are integer lengths. As in the previous solution, the shortest distance
. As a result, a circle of
will not reach the hypotenuse and thus does not intersect it. We also know that a circle of radius
intersects the hypotenuse once and a circle of radius
intersects the hypotenuse twice. Quick graphical thinking or Euclidean construction will prove this.
It follows that we can draw circles of radii and
that each contribute two integer lengths (since these circles intersect the hypotenuse twice) from
to
and one circle of radius
that contributes only one such segment. Our answer is then
~samrocksnature
Video Solution 1(The Beauty of Math)
~IceMatrix
Video Solution 2 by OmegaLearn
https://youtu.be/4_x1sgcQCp4?t=3790
~ pi_is_3.14
See Also
2018 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 15 |
Followed by Problem 17 | |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.