AMC 10 · 2014 · #12

Grade 7 geometry-2dcounting
polygon-inequalitysimilar-trianglessystematic-enumerationgcd systematic-enumerationcasework ↑ Prerequisites: polygon-inequality
📏 Medium solution 💡 3 insights
Problem
No two collected triangles may be congruent or similar, with small whole-number sides. Find the largest collection.

Pick an answer.

(A)
8
(B)
9
(C)
10
(D)
11
(E)
12
How to solve
Strategy Make a Systematic List

The phrase "integer lengths less than 5" quietly makes the whole problem finite, so the first move is to bound the search (Tool #2, Make a Systematic List): every side sits in {1, 2, 3, 4}, and a sorted triple a ≥ b ≥ c is one of only 20 possibilities. Bounding first matters — listing until examples "run out" proves nothing, while checking a list of known length 20 proves everything. Tool #3 (Eliminate Possibilities) applies the triangle inequality to cut 20 down to the triples that are genuinely triangles. Then Tool #16 (Change Focus) reframes the question: since congruent triangles are also similar, the ban is really a single ban on similarity, so S takes at most one triangle per similarity class and the count asked for is a count of classes. Tool #15 (Organize Information in More Ways) supplies the fingerprint that identifies a class — divide a triple by the gcd of its sides — turning "are these two similar?" into "are these two labels equal?".

1STEP 1

Bound the search before listing

Bounding first leaves only 20 candidates.

a, b, c ∈ {1,2,3,4}, a ≥ b ≥ c, C(6, 3) = 20 candidates
2STEP 2

Keep only the real triangles

The triangle inequality keeps 13 of them.

(1,1,1); (2,2,1), (2,2,2); (3,2,2), (3,3,1), (3,3,2), (3,3,3); (4,3,2), (4,3,3), (4,4,1), (4,4,2), (4,4,3), (4,4,4)
3STEP 3

One ban, not two

There is really only one ban.

(a,b,c) ∼ (a',b',c') ⇔ (a,b,c) = k · (a',b',c') for some k > 0
4STEP 4

Fingerprint each shape with the gcd

A common factor fingerprints each shape.

(2,2,2), (3,3,3), (4,4,4) → (1,1,1); (4,4,2) → (2,2,1); 13 - 4 = 9 primitives
5STEP 5

Prove the nine shapes really differ

The surviving shapes are genuinely different.

(b/a, c/a): (1,1), (1,1/2), (1,1/3), (1,2/3), (1,1/4), (1,3/4), (2/3,2/3), (3/4,1/2), (3/4,3/4)
6STEP 6

Match the ceiling with a build

So the largest collection is 9, choice (B).

|S|_max = #{similarity classes} = 9 → (B)
Answer
9
The answer must sit between 1 and 13, since 13 is the exact number of integer-sided triangles available, and it must be strictly below 13 because (1,1,1) and (2,2,2) are visibly the same shape. The value 9 fits, and every listed choice from 8 to 12 is in that window, so the choices give no free hint and the enumeration has to carry the weight. Spot-check the two borderline calls: (4,2,2) was rejected because 2 + 2 = 4 is not greater than 4, a flat degenerate figure rather than a triangle; and (4,4,2) was dropped as a scale copy of (2,2,1), which is right since 4 = 2 × 2, 4 = 2 × 2, 2 = 2 × 1. Also note that the four excluded triangles are the only possible scale copies at all: doubling any surviving primitive other than (1,1,1) and (2,2,1) already pushes a side to at least 6, past the limit of 4.
💡Key takeaway

Count the whole list of possibilities before checking it, then divide each triangle's sides by their common factor — triangles with the same reduced sides are the same shape, and only different shapes are allowed.

  • Bound the search before listing
  • Keep only the real triangles
  • One ban, not two
  • Fingerprint each shape with the gcd
  • Prove the nine shapes really differ
  • Match the ceiling with a build