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)
- E)
Answer
D
Key insight
Sliding along AC, the distance from B falls from 20 to the altitude 420/29 (about 14.5), then rises to 21, hitting each integer once per side.
Solution
The hypotenuse is . The shortest segment from to is the altitude , with
Let a point travel from to along the hypotenuse. The length starts at , decreases steadily to at the foot , then increases steadily to .
- On the stretch from to , takes every value in exactly once, so the integers each occur once: segments.
- On the stretch from to , takes every value in exactly once: the integers occur once each: segments.
No segment has length or less, since . Total: .
The answer is .
Why this works
The distance from a fixed point to a moving point on a segment is a continuous function with a single minimum at the perpendicular foot, so it sweeps each value between the minimum and an endpoint exactly once on each side. Counting integer lengths becomes counting integers in two intervals; the only real computation is the altitude, which fixes the lower bound. Recognizing -- as a Pythagorean triple saves time.
The trap
Counting integers from 15 to 21 once (7 values) and forgetting that lengths 15 through 20 occur twice, on both sides of the foot of the altitude.
Common mistakes
- Counting integers from 15 to 21 once (7 values) and forgetting that lengths 15 through 20 occur twice, on both sides of the foot of the altitude.
- Rounding the altitude to and including length , giving , or excluding the legs themselves despite the problem saying to include them.
Techniques
Bound the quantity above/below or estimate to pin it down · Set up the equation/formula and compute; no special trick needed