2018 AMC 10A Problem 16
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 ?
Show solution without answering
Key insight
Sliding along the hypotenuse, the segment shrinks from 20 to the height (about 14.5), then grows to 21, hitting each whole number once per side.
Solution
Picture a point sliding along the hypotenuse from to , and watch the length of .
1. Find the hypotenuse. .
2. Find the shortest segment. The shortest segment from to the hypotenuse is the one that meets it at a right angle, the height . Compute it with area. Using the legs, the area is . Using the hypotenuse as the base, the area is . So
3. Watch the length change. At , . As moves toward , shrinks smoothly to about . As moves on from to , grows smoothly to .
4. Count whole-number lengths on the first stretch ( to ). The length passes through every value from down to , so it hits once each. That is segments (including itself).
5. Count on the second stretch ( to ). The length passes through every value from up to , so it hits once each. That is segments (including itself).
6. Nothing shorter. No segment is shorter than , so length or less never happens.
Total: .
The answer is .
Why this works
The distance from a fixed point to a point sliding along a line gets smaller until the right-angle spot, then gets larger. So each length between the shortest one and an end is reached exactly once on each side. The only real calculation is the height, which you can get from the area in two ways. Knowing that , , is a right-triangle triple saves a step.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
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 .
Review in the AoPS books
- Introduction to Geometry, Chapter 4: Perimeter and Area (§4.2)
- Introduction to Geometry, Chapter 7: Special Parts of a Triangle
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Introduction to Geometry, Chapter 6: Right Triangles (§6.1, §6.2, §6.3)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.