AMC 10 · 2024 · #24

Grade 10 geometry-2dcounting
inradiuspolygon-inequalityarea-trianglesfraction-arithmetic extreme-principlebound-inequality-then-enumeratesystematic-enumeration ↑ Prerequisites: area-trianglespolygon-inequalityfraction-arithmetic
📏 Long solution 💡 5 insights
Problem
A triangle has three altitudes: the perpendicular distance from each vertex to the opposite side. Count the ordered triples (a,b,c) of positive integers with a ≤ b ≤ c ≤ 9 for which some genuine triangle (positive area, not a flattened one) has altitudes exactly a, b, c from A, B, C, and at the same time has an inradius that is a whole number.

Pick an answer.

(A)
2
(B)
3
(C)
4
(D)
5
(E)
6
How to solve
Strategy Extreme Principle

Altitudes are an awkward thing to search over directly, so the first job is to trade them for something searchable. Naming the area converts each altitude into a side length, and the sides turn out to be the reciprocals 1/a, 1/b, 1/c up to one common scale factor. That single move does two things at once: it says exactly when a triangle with those altitudes exists, and it collapses the inradius into one clean identity. After that the problem is pure inequality-squeezing on integers, and the squeeze is where the Extreme Principle earns its place — the smallest altitude a and the largest altitude c each get pinned between two multiples of r, which cuts the search down to three values of r and a handful of cases. In each surviving case the sum of reciprocals is already at its maximum or its minimum, so equality forces every entry at once.

1STEP 1

Trade altitudes for side lengths

Each side is area over altitude.

S = 1/2 · BC · a → BC = 2S/a, CA = 2S/b, AB = 2S/c
2STEP 2

Cut the triangle at the incenter

The three reciprocals add to one over the inradius.

S = r/2(2S/a + 2S/b + 2S/c) → 1/r = 1/a + 1/b + 1/c
3STEP 3

When does such a triangle exist

Any three positive altitudes work after rescaling.

sides t/a, t/b, t/c → altitudes 2tAa, 2tAb, 2tAc; t = 1/2A → altitudes a, b, c
4STEP 4

Non-degeneracy is one inequality

It is the triangle inequality on reciprocals.

1/b + 1/c > 1/a
5STEP 5

Pin the smallest and largest altitude

Squeezing leaves the inradius as 1, 2, or 3.

2r < a ≤ 3r ≤ c ≤ 9 → r ∈ {1, 2, 3}
6STEP 6

Sweep the three values

Each case forces all three altitudes equal.

r = 1: (3,3,3); r = 2: (6,6,6); r = 3: (9,9,9)
7STEP 7

Count them and read the pattern

That leaves 3 triples.

(a,b,c) = (3r, 3r, 3r), r = 1, 2, 3 → 3 triples
Answer
3
Check each survivor from scratch. An equilateral triangle with altitude h has side 2h/√(3) and inradius h/3, so altitudes 3, 6, 9 give inradii 1, 2, 3 — all integers, and all with c ≤ 9. Now check that nothing was dropped. Solving 1/a + 1/b + 1/c = 1/r over 1 ≤ a ≤ b ≤ c ≤ 9 with no geometry attached gives six triples: (2,3,6) and (2,4,4) and (3,3,3) with r = 1, then (4,8,8) and (6,6,6) with r = 2, then (9,9,9) with r = 3. The three that were rejected fail on exactly the non-degeneracy line: 1/3 + 1/6 = 1/2, 1/4 + 1/4 = 1/2, 1/8 + 1/8 = 1/4 — every one an exact tie, which flattens the triangle into a segment. So the parenthetical word non-degenerate is not decoration: ignoring it would give 6 instead of 3, which is the trap sitting in choice (E).
💡Key takeaway

Altitudes are sides turned upside down, and once you write 1/r = 1/a + 1/b + 1/c the geometry is gone: three unit fractions have to add to another unit fraction while staying close enough in size to still close into a triangle, and only the equilateral ones manage it.

  • Trade altitudes for side lengths
  • Cut the triangle at the incenter
  • When does such a triangle exist?
  • Non-degeneracy is one inequality
  • Pin the smallest and largest altitude
  • Sweep the three values of r
  • Count them and read the pattern