2025 AMC 10B Problem 17
Consider a decreasing sequence of positive integers that satisfies the following two conditions:
The average (arithmetic mean) of the first terms in the sequence is
For all the average of the first terms in the sequence is less than the average of the first terms in the sequence.
What is the greatest possible value of
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
- Start with the numbers. The average of the first terms is , so their total is . Each later average is less than the one before.
| First terms | Average | Total |
|---|---|---|
2. Get each term from the totals. A new term is the new total minus the old total:
The terms drop by each time, not by .
3. Check the pattern in general. The average of the first terms is , so their total is . Then
Multiplying out, and . Subtracting,
So from the fourth term on, every term is fixed:
- Upper limit. All terms must be positive whole numbers, so , which gives and . At the last term is exactly .
5. Can really happen? The first three terms are not fixed; they just need to add to and be bigger than , in decreasing order. For example, works. So the full sequence
is decreasing, positive, and follows both rules.
So the greatest possible is .
The answer is .
Why this works
A rule about averages is really a rule about totals, since total average count. Once you have a formula for the total of the first 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 to terms with average gives a new average only if the new term is less than the old average: . With (the average of the first terms), this gives 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 and . The conditions say and for , so the averages drop by one at every step:
and therefore
Recover the individual terms. For ,
Expanding, and , so
So from the fourth term on nothing is free: the sequence must read , , , dropping by each time. These are automatically decreasing, but they must stay positive integers:
It remains to check that is achievable, which requires the first three terms to exist. They must satisfy and . The smallest possible sum of three distinct integers greater than is , so there is room; for instance
works. With those and for , the sequence is strictly decreasing, entirely positive (the last term is ), and satisfies both conditions.
The answer is .
Review in the AoPS books
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Introduction to Algebra, Chapter 6: Ratios and Percents
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Intermediate Algebra, Chapter 17: More Sequences and Series (§17.1, §17.2)
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.