Skip to main content

2025 AMC 12B Problem 14

Problem 14 of 25IntermediateAlgebra

Consider a decreasing sequence of nn positive integers x1>x2>>xnx_1 \gt x_2 \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?

Answer choices

Show solution

Solution

The average of the first kk terms is Ak=2028kA_k = 2028 - k for k3,k \ge 3, so the partial sum is Sk=k(2028k).S_k = k(2028 - k). For k4,k \ge 4, xk=SkSk1=20292k,x_k = S_k - S_{k-1} = 2029 - 2k, which is positive exactly when k1014.k \le 1014. A valid start such as x1,x2,x3=2030,2023,2022x_1, x_2, x_3 = 2030, 2023, 2022 keeps the whole sequence strictly decreasing, so the greatest possible nn is 1014.1014. Thus, the correct answer is B.

More practice

Concepts: mean · arithmetic sequence · bounding to limit cases

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