AMC 10 · 2005 · #10

Grade 6 arithmetic
recursive-sequencedigit-decompositionpattern-recognition pattern-recognitionidentify-subproblems ↑ Prerequisites: recursive-sequencepattern-recognition
📏 Medium solution 💡 2 insights
Problem
A sequence starts at 2005, and each next term cubes every digit of the previous term and adds those cubes. Find the two thousand fifth term.

Pick an answer.

(A)
29
(B)
55
(C)
85
(D)
133
(E)
250
How to solve
Strategy Look for a Pattern

Computing 2005 terms directly is impossible, so Tool #5 (Look for a Pattern) is the main move: generate the first several terms and watch for a value that repeats, which forces the whole sequence into a cycle. Tool #7 (Identify Subproblems) handles each single step — one cube-of-digits calculation at a time — so the arithmetic stays clean. Tool #9 (Solve an Easier Related Problem) is what finishes it: instead of reaching term 2005 the long way, we replace that with an easy division-remainder question about where 2005 lands inside the short repeating cycle.

1STEP 1

Compute the second term

The second term comes out as 133.

2³+0³+0³+5³ = 8+125 = 133
2STEP 2

Compute the next few terms

Continuing gives 55, then 250, then 133 again.

133 → 55 → 250 → 133
3STEP 3

Spot the repeating cycle

Since each term depends only on the last, the sequence cycles with period three.

term 2,3,4 = 133,55,250; then term 5,6,7 = 133,55,250
4STEP 4

Find where the 2005th term lands

Matching the remainder to the offset gives 250, choice (E).

2005 = 3 × 668 + 1 → 2005 ≡ 1 (mod 3) → 250 = (E)
Answer
250
The answer must be one of the three cycle values {133, 55, 250}, and 250 is on that list — a good sign. Choices (A) 29 and (C) 85 never appear in the sequence at all, so they are pure distractors. Choice (D) 133 is the trap for an off-by-one slip: term 4 is 250 and matches remainder 1, and 2005 also has remainder 1, so lining the target up with term 4 (not term 2) is the key. Since 2005 ≡ 1 (mod 3) exactly like term 4, the value 250 is right.
💡Key takeaway

When a rule keeps feeding a term back into itself, list a few terms until a value repeats, then use the remainder after dividing by the loop length to jump straight to any far-off term.

  • Compute the second term
  • Compute the next few terms
  • Spot the repeating cycle
  • Find where the 2005th term lands