AMC 10 · 2008 · #3

Grade 4 number-theory
factorsdivisor-sumsystematic-enumeration systematic-enumerationidentify-subproblems ↑ Prerequisites: factors
📏 Medium solution 💡 1 insight
📘 View easy version →
Problem
The symbol ⟨ n⟩ means: add up every positive divisor of n except n itself. Apply this operation three times in a row, starting from 6, and find the final result ⟨⟨⟨ 6⟩⟩⟩.

Pick an answer.

(A)
$\ 6$
(B)
$\ 12$
(C)
$\ 24$
(D)
$\ 32$
(E)
$\ 36$

AMC 10 2008 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Identify Subproblems

The triple brackets are three separate ⟨ ⟩ operations stacked on each other. Evaluate the innermost one first, then feed its result into the next. Each ⟨ ⟩ is itself a small task: list the proper divisors, then add them.

1STEP 1

List the divisors of 6

Inside the brackets, 6 splits as 1 × 6 and 2 × 3, so its divisors are 1, 2, 3, 6 — drop 6 itself and keep 1, 2, 3.

6 = 1 × 6 = 2 × 3 → divisors 1,2,3,6; proper divisors 1,2,3
2STEP 2

Add them to get the value of 6

Adding them closes the innermost bracket: 1 + 2 + 3 = 6, so ⟨ 6⟩ = 6 — the number returns itself, a perfect number.

⟨ 6⟩ = 1+2+3 = 6
3STEP 3

Apply the operation again

Since ⟨ 6⟩ is 6, the middle bracket just reads ⟨ 6⟩ all over again, so ⟨⟨ 6⟩⟩ = 6 — the value refuses to move.

⟨⟨ 6⟩⟩ = ⟨ 6⟩ = 6
4STEP 4

Apply the operation a third time

The outer bracket repeats it once more: ⟨⟨⟨ 6⟩⟩⟩ = ⟨ 6⟩ = 6, so any depth of nesting still gives answer (A).

⟨⟨⟨ 6⟩⟩⟩ = ⟨ 6⟩ = 6
Answer
6
The answer 6 matches the starting number, which fits the key fact that 6 is a perfect number (1+2+3=6). Since each ⟨ ⟩ maps 6 to 6, the triple nesting must also give 6. Choice (A) is 6, while the larger choices 12, 24, 32, and 36 would require the value to grow, which cannot happen at a fixed point.
💡Key takeaway

6's proper divisors add back up to 6, so no matter how many times you take the divisor-sum, you always land on 6.

  • List the divisors of 6
  • Add them to get the value of 6
  • Apply the operation again
  • Apply the operation a third time