AMC 10 · 2018 · #12

Grade 4 number-theory
multiplesdivisibility-rulesset-partitionfactors extremal-constructioncasework ↑ Prerequisites: multiplesdivisibility-rules
📏 Medium solution 💡 2 insights
📘 View easy version →
Problem
Pick a set of 6 numbers from 1 through 12 so that no element of the set is a multiple of a smaller element of the same set. Among all such sets, find how small the smallest element can be.

Pick an answer.

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

The question asks for the least possible value of the smallest element, which is a minimize-the-boundary question — Tool #14 (Extreme Principle). The smart move is to test candidate smallest values from the bottom up (2, then 3, then 4) and stop at the first one that lets a full set of 6 be built. Tool #6 (Guess and Check): for each candidate smallest value, try to build a valid set of 6. Tool #2 (Make a Systematic List): after fixing the smallest element, list exactly which larger numbers are still allowed. Tool #3 (Eliminate Possibilities): the answer choices let us rule out 2 and 3, so the first choice that survives is the answer.

1STEP 1

Search from the bottom up

One divides everything, so it is out immediately.

1 ∣ n for every n, so 1∈ S forces a multiple pair → least element ≥ 2
2STEP 2

Try smallest =2

With two, the leftovers still contain a multiple pair.

2∈ S→ allowed ={3,5,7,9,11}, but 3 ∣ 9→ at most 4 usable; 1+4=5 < 6
3STEP 3

Try smallest =3

Three fails to reach six for the same reason.

3∈ S→ allowed ={4,5,7,8,10,11}, but 4 ∣ 8 and 5 ∣ 10→ at most 4 usable; 1+4=5 < 6
4STEP 4

Try smallest =4 and finish

Four admits a real example, so the answer is 4.

S={4,5,6,7,9,11}; no a ∣ b for a < b in S→ least element =4=(C)
Answer
4
The set {4,5,6,7,9,11} passes every check: scanning each pair, no larger number is a multiple of a smaller one, and it has exactly 6 elements with smallest 4. The lower values are genuinely blocked — both 2 and 3 topped out at 5 elements — so 4 is the smallest attainable least element, matching choice (C).
💡Key takeaway

Test the smallest start first: 2 and 3 leave too few non-multiples to reach six, but starting at 4 the set {4,5,6,7,9,11} fits, so the least element is 4, choice (C).

  • Search from the bottom up
  • Try smallest =2
  • Try smallest =3
  • Try smallest =4 and finish