Skip to main content
OlympiadHQ

Browse · harp

Print

imc

geometry intermediate

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 ?
(A)
(B)
(C)
(D)
Solution
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)
Final answer
D