Solveeit Logo

Question

Question: Let $a_1, a_2, a_3, ..., a_n$ be a sequence of positive integers in arithmetic progression with comm...

Let a1,a2,a3,...,ana_1, a_2, a_3, ..., a_n be a sequence of positive integers in arithmetic progression with common difference dd and a3=15a_3 = 15. Then, the maximum value of the sum aa1+aa2+...+aa5a_{a_1} + a_{a_2} + ... + a_{a_5} is ______.

Answer

495

Explanation

Solution

The sequence is an arithmetic progression a1,a2,...,ana_1, a_2, ..., a_n with common difference dd. The terms are given by ak=a1+(k1)da_k = a_1 + (k-1)d. We are given a3=15a_3 = 15, so a1+2d=15a_1 + 2d = 15. Since a1a_1 is a positive integer, a11a_1 \ge 1, which implies 152d115 - 2d \ge 1, so 2d142d \le 14, and d7d \le 7.

The sum to maximize is S=aa1+aa2+aa3+aa4+aa5S = a_{a_1} + a_{a_2} + a_{a_3} + a_{a_4} + a_{a_5}. The expression for the sum can be derived as S=5a1(1+d)5d+10d2S = 5a_1(1+d) - 5d + 10d^2. Substituting a1=152da_1 = 15 - 2d, we get S=5(152d)(1+d)5d+10d2=75+60dS = 5(15 - 2d)(1+d) - 5d + 10d^2 = 75 + 60d.

We need to consider the constraint that aka_k must be positive integers for all k{1,2,...,n}k \in \{1, 2, ..., n\}. If d>0d > 0, then a1=152d1a_1 = 15 - 2d \ge 1, so d{1,2,3,4,5,6,7}d \in \{1, 2, 3, 4, 5, 6, 7\}. In this case, all terms aka_k are positive. The sum S=75+60dS = 75 + 60d is maximized when dd is maximized. The maximum value of dd is 7. For d=7d=7, a1=152(7)=1a_1 = 15 - 2(7) = 1. The sequence starts with 1,8,15,22,29,...1, 8, 15, 22, 29, .... The indices a1,...,a5a_1, ..., a_5 are 1,8,15,22,291, 8, 15, 22, 29. The largest index is a5=29a_5 = 29, so n29n \ge 29. Since a1=1a_1=1 and d=7d=7, all terms aka_k are positive. The maximum value of SS is 75+60(7)=75+420=49575 + 60(7) = 75 + 420 = 495.

If d=0d = 0, then a1=15a_1 = 15. The sequence is 15,15,...15, 15, .... The sum is S=75+60(0)=75S = 75 + 60(0) = 75.

If d<0d < 0, let d=dd = -|d|. Then a1=15+2da_1 = 15 + 2|d|. For the terms a1,...,a5a_1, ..., a_5 to be positive integers, we need a5=15+(53)d=152d>0a_5 = 15 + (5-3)d = 15 - 2|d| > 0, which means 2d<152|d| < 15, so d7|d| \le 7. However, for the sequence to consist of positive integers up to ana_n, we must have an>0a_n > 0. With d<0d < 0, the terms decrease. We need an=15+(n3)d>0a_n = 15 + (n-3)d > 0. Also, we need nmax(a1,...,a5)n \ge \max(a_1, ..., a_5). The maximum index is a1=15+2da_1 = 15 + 2|d|. If n15+2dn \ge 15 + 2|d|, then an15+(15+2d3)d=15+(12+2d)(d)=1512d2d2a_n \ge 15 + (15 + 2|d| - 3)d = 15 + (12 + 2|d|)(-|d|) = 15 - 12|d| - 2|d|^2. For an>0a_n > 0, we need 2d2+12d15<02|d|^2 + 12|d| - 15 < 0. The positive root of 2x2+12x15=02x^2 + 12x - 15 = 0 is x=6+6621.05x = \frac{-6 + \sqrt{66}}{2} \approx 1.05. Since d|d| must be a positive integer, there is no integer d|d| such that 0<d70 < |d| \le 7 and d<1.05|d| < 1.05. Thus, dd cannot be negative.

The possible integer values for dd are {0,1,2,3,4,5,6,7}\{0, 1, 2, 3, 4, 5, 6, 7\}. The sum S=75+60dS = 75 + 60d is maximized when d=7d=7. The maximum value of the sum is 495495.