AMC 10 Step by Step

2026 AMC 10A Problem 18

P16-20~4 minPrint

The strictly decreasing sequence of 1111 positive integers (a0,a1,a2,…,a10)(a_0,a_1,a_2,…,a_{10}) is defined by the recursive rule ak=12ak−1+2a_k=\frac{1}{2}a_{k-1}+2 , for k≥1k \geq 1 . Let NN be the minimum possible value of a0a_0 . What is the sum of the digits of NN ?

Log in to save your progress.
Show solution without answering

Key insight

Measure every term by how far it sits above 4. That distance is cut in half at each step, and it must stay a whole number through ten halvings.

Solution

The rule says: take half of the previous term, then add 22. Before doing any algebra, try it on a number and watch what happens.

1. Try a starting value. Start at a0=20a_0 = 20:
20→12→8→6→5→4.520 \to 12 \to 8 \to 6 \to 5 \to 4.5
The sixth term is already a fraction, so 2020 is far too small. Notice that the terms are creeping down toward 44.

  1. Why 44 is special. If a term equals 44, the next one is 12⋅4+2=4\frac12 \cdot 4 + 2 = 4 again. A sequence that reaches 44 is stuck there forever.
  1. Look at the distance above 44. Here is the example again, with each term's distance above 44 underneath:
term202012128866554.54.5
distance above 441616884422110.50.5

Each distance is exactly half of the one before. This always happens. If a term is 4+d4 + d, the next term is
12(4+d)+2=2+d2+2=4+d2.\frac12(4 + d) + 2 = 2 + \frac{d}{2} + 2 = 4 + \frac{d}{2}.
So the rule simply halves the distance above 44.

4. What the two conditions say about the distance.
- Every term is a whole number, so every distance is a whole number.
- The terms must go down. If the distance were 00, the terms would all equal 44 and stay put. If a term were below 44 (a negative distance), halving would bring it up toward 44. So the distance must be positive at every step.

  1. Count the halvings. From a0a_0 to a10a_{10} there are 1010 steps, not 1111. So the distance at a10a_{10} equals the starting distance divided by 210=10242^{10} = 1024. That final distance must be a positive whole number, so it is at least 11. Therefore the starting distance is at least 10241024.

6. The smallest start. A starting distance of exactly 10241024 works: the distances are 1024,512,256,…,2,11024, 512, 256, \ldots, 2, 1, all positive whole numbers. That gives a0=4+1024=1028a_0 = 4 + 1024 = 1028, and the sequence is
1028, 516, 260, 132, 68, 36, 20, 12, 8, 6, 5.1028,\ 516,\ 260,\ 132,\ 68,\ 36,\ 20,\ 12,\ 8,\ 6,\ 5.
That is 1111 positive integers, each smaller than the one before. So N=1028N = 1028.

  1. Digit sum. 1+0+2+8=111 + 0 + 2 + 8 = 11.

The answer is (D) 11\boxed{\textbf{(D)}\ 11}.

Why this works

A rule of the form "multiply by a number, then add a constant" always has one value it leaves unchanged; here it is 44, found by solving x=x2+2x = \frac{x}{2} + 2. Measuring every term from that value turns the rule into plain halving, which is easy to follow for many steps. Next time you see a rule like this, find the unchanged value first and measure from it.

Alternative approach

Run the rule backwards. Undoing "halve, then add 22" means "subtract 22, then double", that is, ak−1=2ak−4a_{k-1} = 2a_k - 4.

1. Every term must be bigger than 44 (see step 4 above), so the last term a10a_{10} is at least 55.
2. Running the rule backwards keeps whole numbers whole, and a bigger last term gives a bigger first term. So the smallest a0a_0 comes from the smallest last term, a10=5a_{10} = 5.
3. Double and subtract 44, ten times:
5→6→8→12→20→36→68→132→260→516→1028.5 \to 6 \to 8 \to 12 \to 20 \to 36 \to 68 \to 132 \to 260 \to 516 \to 1028.

So N=1028N = 1028, and its digit sum is 1111.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Let dk=ak−4d_k = a_k - 4. The rule becomes dk=12dk−1d_k = \frac12 d_{k-1}, so d10=d0/210=d0/1024d_{10} = d_0 / 2^{10} = d_0/1024.

Because the terms are integers, every dkd_k is an integer. Because the sequence strictly decreases, 12dk−1<dk−1\frac12 d_{k-1} < d_{k-1}, which forces dk−1>0d_{k-1} > 0; so d9>0d_9 > 0 and then d10=12d9>0d_{10} = \frac12 d_9 > 0 too. Hence d10≥1d_{10} \ge 1 and d0≥1024d_0 \ge 1024.

Taking d0=1024d_0 = 1024 gives 1028,516,260,132,68,36,20,12,8,6,51028, 516, 260, 132, 68, 36, 20, 12, 8, 6, 5, which meets every condition. So N=1028N = 1028, with digit sum 1+0+2+8=111 + 0 + 2 + 8 = 11.

The answer is (D) 11\boxed{\textbf{(D)}\ 11}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.