Skip to main content

2025 AMC 10B Problem 17

Problem 17 of 25IntermediateAlgebra

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 conditions. The average 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?

Answer choices

Show solution

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. This bound is attainable: take (x1,x2,x3)=(2030,2023,2022),(x_1,x_2,x_3) = (2030,2023,2022), which is decreasing, sums to 6075,6075, and lies above x4=2021.x_4 = 2021. Thus the greatest possible value is n=1014,n = 1014, so B is the correct answer.

More practice

Concepts: mean · summation · bounding to limit cases

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.