AMC 10 · 2012 · #25

Grade 7 probability
geometric-probabilitysystematic-enumeration easier-related-problemguess-and-check ↑ Prerequisites: probability-basicinterval-arithmetic
📏 Medium solution 💡 4 insights
Problem
Three real numbers x, y, z are each picked at random from the interval [0,n], independently, where n is a positive integer. Call a pick "good" if no two of the three numbers land within 1 unit of one another. As n grows, more room means a good pick becomes more likely. Find the smallest whole number n for which the probability of a good pick is more than 1/2.

Pick an answer.

(A)
7
(B)
8
(C)
9
(D)
10
(E)
11

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

How to solve
Strategy Visualize Spatial Relationships

A probability over continuous random choices is a volume comparison, so Tool #17 (Visualize Spatial Relationships) is the spine: the triple (x,y,z) is a point in the cube [0,n]³, and the probability is (good volume)/n³. Measuring the good region head-on is messy, so Tool #9 (Solve an Easier Related Problem) fixes one ordering x < y < z by symmetry, turning three absolute-value conditions into two simple gaps. Then Tool #4 (Introduce a Variable) does the key move: a shift substitution that squeezes the gaps out and collapses the good region into a smaller cube, giving its volume in one line. Tool #7 (Identify Subproblems) assembles the clean probability formula, and Tool #3 (Eliminate Possibilities) tests the answer choices against the 1/2 threshold to pin down the smallest n.

1STEP 1

Turn the probability into a volume

The point (x,y,z) spreads evenly through the cube [0,n]³, so the probability is the good volume divided by .

(x,y,z)∈[0,n]³, Vol(cube)=n³, P=(Vol(good region))/n³
2STEP 2

Fix one order to simplify the conditions

By symmetry measure one ordering x < y < z and multiply by 6; the conditions become just y-x ≥ 1, z-y ≥ 1.

x < y < z: y-x ≥ 1, z-y ≥ 1 → z-x ≥ 2
3STEP 3

Shift the gaps out with a substitution

Set u=x, v=y-1, w=z-2: the gaps vanish into 0 ≤ u ≤ v ≤ w ≤ n-2, so six such pieces fill a cube of volume (n-2)³.

u=x, v=y-1, w=z-2: 0 ≤ u ≤ v ≤ w ≤ n-2; Vol(good)=6·((n-2)³)/6=(n-2)³
4STEP 4

Write the probability and the target inequality

Divide the two volumes: the good-pick probability is ((n-2)/n)³, and we want it to beat 1/2.

P=((n-2)³)/n³=((n-2)/n)³ > 1/2
5STEP 5

Test the choices against one half

n=9 gives 343/729≈ 0.470, still short; n=10 gives 0.512, over half. The smallest value is 10, choice (D).

n=9: 343/729≈ 0.470 < 1/2; n=10: 512/1000=0.512 > 1/2 → (D)
Answer
10
The formula behaves sensibly at the edges: at n=2 it gives 0 (there is no room to keep three points a unit apart), and as n→∞ it approaches 1 (almost any pick is fine). In between, ((n-2)/n)³ climbs steadily, so the half-mark is crossed exactly once. Our two checks bracket it cleanly: 0.470 < 0.5 < 0.512, so the crossover sits between 9 and 10, and n=10 is the first integer above it. That 0.512 only barely clears one half fits a problem placed at the #25 slot, where the threshold is meant to be tight.
💡Key takeaway

A probability with random real numbers is really a chunk of volume: the point (x,y,z) fills the cube [0,n]³, the "all gaps ≥ 1" region is a shifted cube of side n-2, so the chance is ((n-2)/n)³ — and it first passes one half at n=10.

  • Turn the probability into a volume
  • Fix one order to simplify the conditions
  • Shift the gaps out with a substitution
  • Write the probability and the target inequality
  • Test the choices against one half