2025 AMC 12B Problem 14

Below is the professionally curated solution for Problem 14 of the 2025 AMC 12B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2025 AMC 12B 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:meanarithmetic sequencebounding to limit cases

Difficulty rating: 1730

14.

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?

10131013

10141014

10161016

20162016

20252025

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.

Problem 14 in Other Years