AMC 10 Step by Step

Geometric Optimization

Maximum/minimum length or area, shortest paths, extremal configurations

Print these 4
4
primary-topic problems (0.3% of all)
7
more as a secondary topic
Where it appears
3
P1-10
0
P11-15
1
P16-20
0
P21-25

What you need to know

  • Triangle Inequality. Any two sides must add up to more than the third, strictly. It is enough to check the two shorter sides against the longest: 11, 33, 1010 fails because 1+3<101+3<10, even though 1+10>31+10>3. If the two shorter sides add up to exactly the longest, the "triangle" is flat. Example: with sides 55 and 88, the third side is strictly between 33 and 1313. So the largest or smallest possible length is often only approached, as the triangle flattens into a line.
  • Shortest path by reflection. Let AA and BB be on the same side of a line ℓ\ell. To make AP+PBAP + PB smallest with PP on ℓ\ell, reflect BB across ℓ\ell to get B′B'. Since PB=PB′PB = PB', the minimum is the straight distance AB′AB', reached where AB′AB' crosses ℓ\ell. Example: for A=(0,3)A = (0,3), B=(8,3)B = (8,3) and ℓ\ell the xx-axis, B′=(8,−3)B' = (8,-3), so the shortest path is AB′=82+62=10AB' = \sqrt{8^2+6^2} = 10, through P=(4,0)P = (4,0). (If AA and BB are on opposite sides, no reflection is needed: ABAB crosses ℓ\ell.)
  • Largest triangle with two given sides. With sides aa and bb, the area is at most 12ab\frac12 ab, reached when the angle between them is 90∘90^\circ. Why: with base aa, the height is at most bb (in trig terms, 12absin⁡C≤12ab\frac12 ab\sin C \le \frac12 ab). Example: sides 66 and 88 give area at most 2424.

How AMC 10 tests it

  • "Largest possible area of a triangle with sides aa and bb?" or "...with integer sides and perimeter nn?" (problems 8–15).
  • A spider or ant on a box or cylinder. Unfold the surface flat and compare a few nets.
  • The largest number of crossing points of lines, circles, and polygons. You need an upper bound (why it can't be more) and a construction (a drawing that reaches it).

Standard approaches

  1. Reflect a fixed point across the line the path must touch (or unfold the surface), so the path becomes a straight segment.
  2. Push the figure to its extreme case (points in a line, a right angle, a tangent), then check that the problem allows it.
  3. For "largest number of" questions, find the most each pair of shapes can contribute, then draw an example that reaches the total. Example: for 33 circles and 11 line, each of the 66 pairs crosses at most twice, so there are at most 1212 points, and 1212 can be drawn.

Worked example

Points AA and BB lie on the same side of line ℓ\ell, at distances 22 and 66 from ℓ\ell, and the feet of the perpendiculars from AA and BB to ℓ\ell are 1515 units apart. Point PP on ℓ\ell minimizes AP+PBAP + PB. What is APAP?

(A) 154\dfrac{15}{4} (B) 44 (C) 174\dfrac{17}{4} (D) 92\dfrac92 (E) 55

Solution. Step 1. Reflect AA across ℓ\ell to get A′A', 22 units below ℓ\ell. For every PP on ℓ\ell, AP=A′PAP = A'P, so AP+PB=A′P+PB≥A′BAP + PB = A'P + PB \ge A'B.

Step 2. A′A' and BB are 2+6=82 + 6 = 8 apart vertically and 1515 apart horizontally, so A′B=82+152=17A'B = \sqrt{8^2+15^2} = 17.

Step 3. PP is where A′BA'B crosses ℓ\ell. The right triangles on either side of PP (heights 22 and 66) are similar, so PP splits the 1515 in the ratio 2:6=1:32:6 = 1:3. That puts PP at 154\frac{15}{4} from the foot of AA.

Step 4. APAP is the hypotenuse of a right triangle with legs 22 and 154\frac{15}{4}:
AP=22+(154)2=6416+22516=28916=174. AP = \sqrt{2^2 + \left(\tfrac{15}{4}\right)^2} = \sqrt{\tfrac{64}{16} + \tfrac{225}{16}} = \sqrt{\tfrac{289}{16}} = \tfrac{17}{4}.
The answer is (C) 174\boxed{\textbf{(C)}\ \dfrac{17}{4}}.

Pitfalls

  • Reflecting both points (which gives back the same problem), or reflecting the wrong one.
  • Giving the whole minimum (1717 above) when the problem asks for one piece (APAP).
  • Forgetting the construction in a "largest number" problem. Showing it can't be more than 1212 is only half; you must also show 1212 can happen.

Traps that recur

  • Picking choice (E), which needs 5 space diagonals, without checking that a corner can be the endpoint of only one space diagonal. (2010 AMC 10A #20)
  • Assuming a triangle with the given perimeter and area exists and answering 2 or 4 by symmetry, without checking whether height 20 is reachable. (2019 AMC 10B #10)
  • Answering 13 by allowing the longest side to equal the sum of the other three, which gives a degenerate flat figure. (2023 AMC 10A #4)
  • Stacking the rectangles end to end (3 + 4 = 7) and answering 49, without trying the side-by-side arrangement. (2006 AMC 10B #5)

Problems, easiest first

Open any of them to try it here; the worked solution is on the problem's own page.