AMC 10 · 2014 · #13
Grade 9 geometry-2dPick an answer.
The problem is stated as a ban: two triples are forbidden from being triangles. A ban is hard to compute with, so the first move is to flip it. Three lengths make a triangle with positive area exactly when the longest is shorter than the sum of the other two, so "no triangle with positive area" is exactly "the longest is at least the sum of the other two". That turns each ban into a plain inequality. The two inequalities involve both a and b, and only b is being minimised, so I reorganise them: I hold b fixed and ask which values of a survive. One condition pushes a down, the other pushes a up, so together they trap a inside an interval. A value of b is legal exactly when that interval is not empty, which is a single inequality in b alone. Its boundary is where the interval shrinks to one point, and that is the extreme case the question is asking about. The last piece is the part that is easy to skip: proving the boundary value is actually attained, by producing the exact a that goes with it and checking both original conditions on the nose.
Flip the ban into an inequality
Failing is the triangle inequality reversed.
A triangle collapses the instant the longest side is as long as the other two laid end to end, so the ban is just that race being lost.
A triangle collapses the instant the longest side is as long as the other two laid end to end.
▸ Why?
Any two sides together must reach further than the third, or the ends never meet.
▸ Why?
So the ban is a race between two lengths, and which one wins is settled by a single comparison.
Write both bans as inequalities
Both bans become clean inequalities.
Sorting each triple first tells me which length has to win the race, and the rest is bookkeeping.
9.A-CED.A.3Convert To AlgebraClear fractions in the second ban
Clearing fractions makes the second one usable.
Multiplying by something known to be positive rewrites an inequality without disturbing which side is larger.
9.A-REI.B.3Organize Information In More WaysTrap a between two bounds
The smaller number is trapped between two bounds.
One rule sets a floor for a and the other sets a ceiling, so a exists exactly when the floor is not above the ceiling.
9.A-CED.A.3Organize Information In More WaysNon-empty interval forces a quadratic
A non-empty trap forces one quadratic.
The floor rises and the ceiling falls as b shrinks, so there is one exact moment when they meet, and a quadratic locates it.
9.A-REI.B.4Extreme PrincipleShow the bound is reached
Its root is reached, so choice (B) stands.
At the extreme both triangles are squashed perfectly flat at once, which is the only way to make b as small as it can be.
9.A-SSE.A.2Extreme PrincipleRewrite "these lengths cannot make a triangle" as "the longest side is at least the other two combined", then let one rule push the middle number up and the other push it down; the smallest b is where the two pushes exactly meet.
- Flip the ban into an inequality
- Write both bans as inequalities
- Clear fractions in the second ban
- Trap a between two bounds
- Non-empty interval forces a quadratic
- Show the bound is reached