2025 AMC 10B Problem 17

Below is the professionally curated solution for Problem 17 of the 2025 AMC 10B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2025 AMC 10B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:meansummationbounding to limit cases

Difficulty rating: 1910

17.

Consider a decreasing sequence of nn positive integers x1>x2>x3>>xnx_1 \gt x_2 \gt x_3 \gt \cdots \gt x_n that satisfies the following two conditions. The average (arithmetic mean) of the first 33 terms in the sequence is 2025.2025. For all 4kn,4 \le k \le n, the average of the first kk terms in the sequence is 11 less than the average of the first k1k - 1 terms in the sequence.

What is the greatest possible value of n?n?

10131013

10141014

10161016

20162016

20252025

Solution:

Let AkA_k be the average of the first kk terms. Then A3=2025A_3 = 2025 and Ak=Ak11A_k = A_{k-1} - 1 for k4,k \ge 4, so Ak=2028k.A_k = 2028 - k. The partial sum is Sk=k(2028k),S_k = k(2028 - k), and for k4k \ge 4 the terms are xk=SkSk1=20292k,x_k = S_k - S_{k-1} = 2029 - 2k, namely x4=2021,x5=2019,.x_4 = 2021, x_5 = 2019, \ldots. These stay positive as long as 20292k>0,2029 - 2k \gt 0, that is k1014,k \le 1014, with x1014=1.x_{1014} = 1. We can pick the first three terms as decreasing integers above 20212021 summing to 6075,6075, so n=1014n = 1014 is reachable. Thus, B is the correct answer.

Problem 17 in Other Years