AMC 10 · 2015 · #25

Grade 11 geometry-2d
descartes-circle-theoremtangent-circlespythagorean-theoremrecursive-sequencesequences-geometric pattern-recognitionsymmetry-argument ↑ Prerequisites: tangent-circlespythagorean-theorem
📏 Long solution 💡 4 insights 📊 Diagram
Problem
Each new circle rests on a line and touches the two circles beside it. Add a reciprocal root over every circle built.

Pick an answer.

(A)
$\frac{286}{35}$
(B)
$\frac{583}{70}$
(C)
$\frac{715}{73}$
(D)
$\frac{143}{14}$
(E)
$\frac{1573}{146}$
How to solve
Strategy Introduce a Variable

The radii themselves are hopeless to track — after six layers there are 65 of them and they are ratios of enormous squares. But the problem does not ask for radii; it asks for 1/√(r), and that is the hint. Tool #1 (Draw a Diagram) puts a radius straight down to the x-axis at each tangency point, turning "these two circles touch" into a right triangle and giving the exact horizontal gap between tangency points. Tool #3 (Eliminate Possibilities) is needed because two different circles are tangent to the x-axis and externally tangent to both parents; the layer count 2^k-1 and the figure pick out the one in the gap. Tool #4 (Introduce a Variable) is the crux: name j(C)=1/√(r(C)), and the tangency relation becomes plain addition, j_new=j_left+j_right. After that no geometry is left. Tool #15 (Organize Information in More Ways) re-reads one layer's total as "twice everything built so far, minus the two end values", and Tool #5 (Look for a Pattern) turns the resulting recursion into a closed form.

1STEP 1

Two numbers describe each circle

Two numbers describe each circle.

(p-q)²+(r-s)²=(r+s)² ⟺ (p-q)²=4rs ⟺ |p-q|=2√(rs)
2STEP 2

Pin down which new circle is meant

Touching neighbours gives one equation.

2√(r₁z)+2√(r₂z)=p₂-p₁=2√(r₁r₂)
3STEP 3

Divide by 2√(r₁r₂z)

Dividing through simplifies it completely.

1/√(z)=1/√(r₁)+1/√(r₂)
4STEP 4

Rename 1/√(r) as j

In the new variable the rule is just addition.

j(C)=1/√(r(C)); j_new=j_left+j_right; S₀=T₀=1/70+1/73
5STEP 5

A layer's total: double, minus the ends

A layer's total doubles, minus the two ends.

S_k=2T_k-1-S₀, T_k=T_k-1+S_k=3T_k-1-S₀
6STEP 6

Solve the recursion

That recursion solves in closed form.

T_k-S₀/2=3(T_k-1-S₀/2) → T_k=(3^k+1)/2S₀, T₆=365 S₀
7STEP 7

Put the numbers in

Substituting gives 143/14, choice (D).

Σ_C∈ S1/√(r(C))=365(1/70+1/73)=365·143/5110=143/14 (D)
8STEP 8

Check the construction really behaves

Rebuilding the layers confirms it.

|L₀|,…,|L₆| = 2,1,2,4,8,16,32 (total 65); rebuilt sum =10.2142857…=143/14
Answer
143/14
The whole answer is a multiple of S₀=1/70+1/73≈ 0.02799, and the multiplier (3^k+1)/2 is trapped between 3⁶/2=364.5 and 365. So the total must lie between 364.5 S₀≈ 10.20 and 365 S₀≈ 10.21 — a window that contains only choice (D) 143/14≈ 10.214; the nearest other option, (E) 1573/146≈ 10.77, is far outside it, and (A), (B), (C) are all below 9.8. The structure also passes its own bookkeeping: the layer totals come out S₀,S₀,3S₀,9S₀,27S₀,81S₀,243S₀, whose sum 1+1+3+9+27+81+243=365 matches (3⁶+1)/2 independently. A direct numerical rebuild of all 65 circles — solving the tangency equations for each new radius rather than using the derived formula — reproduces 10.214285714… to fifteen digits.
💡Key takeaway

Circles resting on a line add up in 1/√(r), so name that number and the picture turns into a list where every new entry is the sum of its two neighbours.

  • Two numbers describe each circle
  • Pin down which new circle is meant
  • Divide by 2√(r₁r₂z)
  • Rename 1/√(r) as j
  • A layer's total: double, minus the ends
  • Solve the recursion
  • Put the numbers in
  • Check the construction really behaves