Skip to main contentSkip to solution

Let a1,a2,…,a52a_{1}, a_{2}, \ldots, a_{52} be positive integers such that a1<a2<…<a52a_{1}<a_{2}<\ldots<a_{52}. Suppose, their arithmetic mean is one less than the arithmetic mean of a2,a3a_{2}, a_{3}, …,a52\ldots, a_{52}. If a52=100a_{52}=100, then the largest possible value of a1a_{1} is

Solution

✅ Correct Option: 2

We have 52 positive integers arranged in increasing order: a1<a2<a3<...<a52a_1 < a_2 < a_3 < ... < a_{52}.

The key condition is: The average of all 52 numbers is exactly 1 less than the average of the last 51 numbers.

We call:

  • Average of all 52 numbers = MM
  • Average of last 51 numbers = M+1M + 1

From the averages:

  • Sum of all 52 numbers = 52M52M
  • Sum of last 51 numbers = 51(M+1)=51M+5151(M + 1) = 51M + 51

Since a1+a_1 + (sum of last 51 numbers) = sum of all 52 numbers:

a1+(51M+51)=52Ma_1 + (51M + 51) = 52M

a1=52M−51M−51=M−51a_1 = 52M - 51M - 51 = M - 51

This is our key relationship! To maximize a1a_1, we need to maximize MM.


To maximize MM, we need to maximize the sum of all 52 numbers, which means maximizing the sum of the last 51 numbers (since a1=M−51a_1 = M - 51).

The constraint: We need a1<a2<a3<...<a52=100a_1 < a_2 < a_3 < ... < a_{52} = 100

The strategy: To maximize the sum a2+a3+...+a52a_2 + a_3 + ... + a_{52}, we should make these numbers as large as possible while maintaining strict inequality.

The optimal arrangement is to make them consecutive integers ending at 100:

  • a52=100a_{52} = 100
  • a51=99a_{51} = 99
  • a50=98a_{50} = 98
  • ...
  • a2=50a_2 = 50

So a2,a3,...,a52a_2, a_3, ..., a_{52} become: 50, 51, 52, ..., 100


Sum of consecutive integers from 50 to 100:

Using the formula: Sum = (first term + last term)×number of terms2\frac{\text{(first term + last term)} \times \text{number of terms}}{2}

Sum = (50+100)×512=150×512=3825\frac{(50 + 100) \times 51}{2} = \frac{150 \times 51}{2} = 3825


Since sum of last 51 numbers = 51M+51=382551M + 51 = 3825:

51M=3825−51=377451M = 3825 - 51 = 3774

M=377451=74M = \frac{3774}{51} = 74

Therefore: a1=M−51=74−51=23a_1 = M - 51 = 74 - 51 = 23


Therefore, the largest possible value of a1a_1 is 23.


Key Insight: The secret to solving this problem is recognizing that to maximize a1a_1, we need to maximize the sum of the other 51 numbers, which is achieved by making them consecutive integers ending at the given maximum value.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question