AMC 10 Step by Step

2025 AMC 10B Problem 17

P16-20~6 minPrint

Consider a decreasing sequence of nn positive integers x1>x2>⋯>xnx_1 > x_2 > \dotsb > x_n that satisfies the following two conditions:

∙\qquad\bullet The average (arithmetic mean) of the first 33 terms in the sequence is 2025.2025.

∙\qquad\bullet For all 4≤k≤n,4 \leq k \leq n, the average of the first kk terms in the sequence is 11 less than the average of the first k−1k - 1 terms in the sequence.

What is the greatest possible value of n?{n?}

Log in to save your progress.
Show solution without answering

Key insight

The average of the first k terms is 2028 − k, so their total is k(2028 − k). Subtracting totals shows later terms drop by 2.

Solution

  1. Start with the numbers. The average of the first 33 terms is 20252025, so their total is 3×2025=60753 \times 2025 = 6075. Each later average is 11 less than the one before.
First kk termsAverageTotal
332025202560756075
442024202480968096
55202320231011510115
66202220221213212132

2. Get each term from the totals. A new term is the new total minus the old total:
x4=8096−6075=2021,x5=10115−8096=2019,x6=12132−10115=2017.x_4 = 8096 - 6075 = 2021, \quad x_5 = 10115 - 8096 = 2019, \quad x_6 = 12132 - 10115 = 2017.
The terms drop by 22 each time, not by 11.

3. Check the pattern in general. The average of the first kk terms is 2025−(k−3)=2028−k2025 - (k - 3) = 2028 - k, so their total is k(2028−k)k(2028 - k). Then
xk=k(2028−k)−(k−1)(2029−k).x_k = k(2028 - k) - (k-1)(2029 - k).
Multiplying out, k(2028−k)=2028k−k2k(2028-k) = 2028k - k^2 and (k−1)(2029−k)=2030k−k2−2029(k-1)(2029-k) = 2030k - k^2 - 2029. Subtracting,
xk=2029−2kfor k≥4.x_k = 2029 - 2k \qquad \text{for } k \ge 4.
So from the fourth term on, every term is fixed: 2021,2019,2017,…2021, 2019, 2017, \ldots

  1. Upper limit. All terms must be positive whole numbers, so 2029−2n≥12029 - 2n \ge 1, which gives 2n≤20282n \le 2028 and n≤1014n \le 1014. At n=1014n = 1014 the last term is exactly 11.

5. Can n=1014n = 1014 really happen? The first three terms are not fixed; they just need to add to 60756075 and be bigger than x4=2021x_4 = 2021, in decreasing order. For example, 2028+2025+2022=60752028 + 2025 + 2022 = 6075 works. So the full sequence
2028, 2025, 2022, 2021, 2019, 2017, …, 3, 12028,\ 2025,\ 2022,\ 2021,\ 2019,\ 2017,\ \ldots,\ 3,\ 1
is decreasing, positive, and follows both rules.

So the greatest possible nn is 10141014.

The answer is (B) 1014\boxed{\textbf{(B)}\ 1014}.

Why this works

A rule about averages is really a rule about totals, since total == average ×\times count. Once you have a formula for the total of the first kk terms, subtracting two neighboring totals gives each term. For a "greatest possible" answer, finish both halves: find the bound (terms must stay positive) and show the bound is reached (the first three terms can be chosen to fit).

Alternative approach

Think about what a new term does to the average. Adding xkx_k to k−1k - 1 terms with average AA gives a new average A−1A - 1 only if the new term is kk less than the old average: xk=A−kx_k = A - k. With A=2029−kA = 2029 - k (the average of the first k−1k-1 terms), this gives xk=2029−2kx_k = 2029 - 2k again.

Concise solution

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

Let Sk=x1+⋯+xkS_k = x_1 + \dots + x_k and Ak=Sk/kA_k = S_k / k. The conditions say A3=2025A_3 = 2025 and Ak=Ak−1−1A_k = A_{k-1} - 1 for k≥4k \ge 4, so the averages drop by one at every step:
Ak=2025−(k−3)=2028−k(k≥3),A_k = 2025 - (k - 3) = 2028 - k \qquad (k \ge 3),
and therefore
Sk=k(2028−k)(k≥3).S_k = k(2028 - k) \qquad (k \ge 3).

Recover the individual terms. For k≥4k \ge 4,
xk=Sk−Sk−1=k(2028−k)−(k−1)(2029−k).x_k = S_k - S_{k-1} = k(2028-k) - (k-1)\bigl(2029 - k\bigr).
Expanding, k(2028−k)=2028k−k2k(2028-k) = 2028k - k^2 and (k−1)(2029−k)=2030k−k2−2029(k-1)(2029-k) = 2030k - k^2 - 2029, so
xk=2029−2k.x_k = 2029 - 2k.

So from the fourth term on nothing is free: the sequence must read x4=2021x_4 = 2021, x5=2019x_5 = 2019, x6=2017,…x_6 = 2017, \dots, dropping by 22 each time. These are automatically decreasing, but they must stay positive integers:
2029−2n≥1  ⟺  n≤1014.2029 - 2n \ge 1 \iff n \le 1014.

It remains to check that n=1014n = 1014 is achievable, which requires the first three terms to exist. They must satisfy x1>x2>x3>x4=2021x_1 > x_2 > x_3 > x_4 = 2021 and x1+x2+x3=3⋅2025=6075x_1 + x_2 + x_3 = 3 \cdot 2025 = 6075. The smallest possible sum of three distinct integers greater than 20212021 is 2024+2023+2022=6069≤60752024 + 2023 + 2022 = 6069 \le 6075, so there is room; for instance
2028, 2025, 20222028,\ 2025,\ 2022
works. With those and xk=2029−2kx_k = 2029 - 2k for 4≤k≤10144 \le k \le 1014, the sequence is strictly decreasing, entirely positive (the last term is x1014=1x_{1014} = 1), and satisfies both conditions.

The answer is (B) 1014\boxed{\textbf{(B)}\ 1014}.

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.