AMC 10 · 2008 · #11

Grade 6 geometry-3dlogic
net-foldingface-adjacencyoptimization spatial-visualizationcomplementary-counting ↑ Prerequisites: net-folding
📏 Long solution 💡 3 insights 📊 Diagram
Problem
Three identical numbered cubes are stacked in a tower on a table, hiding five faces. Each cube may be turned any way. Find the largest possible total of the visible numbers.

Pick an answer.

(A)
154
(B)
159
(C)
164
(D)
167
(E)
189
How to solve
Strategy Visualize Spatial Relationships

Chasing 13 visible numbers is messy; chasing the 5 hidden ones is short, so flip to the complement and subtract from the fixed grand total. But the complement only helps once we know what the hidden faces are allowed to be, and that is a folding question: on a stacked cube the covered top and bottom are opposite faces, so we must fold the net to learn which numbers sit opposite which. That single fact is what stops us from simply hiding the smallest numbers. After the folding gives a lower bound on the hidden sum, we still have to build an actual stack that reaches it, since a bound nobody can hit is not an answer.

1STEP 1

Locate the five hidden faces

Exactly five faces end up hidden, in a two-two-one pattern.

18 - 13 = 5 = 2 + 2 + 1
2STEP 2

Fold the net to find the opposite pairs

Folding the net fixes which numbers sit opposite.

1 ⇔ 32, 2 ⇔ 16, 4 ⇔ 8
3STEP 3

Rule out hiding the two smallest

The pairings rule out hiding the two smallest numbers together.

1 + 32 = 33, 2 + 16 = 18, 4 + 8 = 12
4STEP 4

Swap the question for its complement

Maximizing the visible is minimizing the hidden.

visible = 189 - hidden, 189 = 3 × 63
5STEP 5

Push the hidden total to its floor

The hidden total cannot drop below 25.

hidden ≥ 12 + 12 + 1 = 25
6STEP 6

Build a stack that reaches the floor

A real stack reaches that floor, giving 164, choice (E).

189 - 25 = 164
Answer
164
The two larger choices can be ruled out on their own. Choice (E) 189 is the total of all 18 faces, which would need nothing hidden, impossible when 5 faces are covered and every face is at least 1. Choice (D) 167 needs a hidden total of 189 - 167 = 22, but the two covered pairs alone already force at least 12 + 12 = 24, so 22 cannot happen. Meanwhile 164 was not merely bounded but exhibited by a concrete stack, so it is both reachable and the largest reachable value, confirming (C).
💡Key takeaway

Covering the top and bottom of a cube always hides two opposite faces, so you can only hide a number together with the one across from it.

  • Locate the five hidden faces
  • Fold the net to find the opposite pairs
  • Rule out hiding the two smallest
  • Swap the question for its complement
  • Push the hidden total to its floor
  • Build a stack that reaches the floor