Maths Olympiad Prep

Track / Stage 6 / 264 of 400 #1264 of 1964

Problem 1264

National olympiad, first round
Combinatorics Difficulty 6.5 Find the answer

Find all of the sequences a1,a2,a3,...a_1, a_2, a_3, . . . of real numbers that satisfy the following property: given any sequence b1,b2,b3,...b_1, b_2, b_3, . . . of positive integers such that for all n1n \ge 1 we have bnbn+1b_n \ne b_{n+1} and bnbn+1b_n | b_{n+1}, then the sub-sequence ab1,ab2,ab3,...a_{b_1}, a_{b_2}, a_{b_3}, . . . is an arithmetic progression.

A number or a short expression. Spacing, $ signs and \frac vs / are all fine.

Official solution

1. Initial Setup and Assumptions:
We are given a sequence a1,a2,a3,a_1, a_2, a_3, \ldots of real numbers. We need to find all such sequences that satisfy the property: for any sequence b1,b2,b3,b_1, b_2, b_3, \ldots of positive integers such that bnbn+1b_n \neq b_{n+1} and bnbn+1b_n \mid b_{n+1} for all n1n \geq 1, the subsequence ab1,ab2,ab3,a_{b_1}, a_{b_2}, a_{b_3}, \ldots forms an arithmetic progression.

2. Choosing Specific Sequences:
Consider the sequence b1=1,b2=p,b3=npb_1 = 1, b_2 = p, b_3 = np for some n>1n > 1 and a prime pp. According to the problem, a1,ap,anpa_1, a_p, a_{np} must form an arithmetic progression. Therefore, we have:
anp=2apa1 a_{np} = 2a_p - a_1
This equation must hold for any nn and any prime pp.

3. Implication for General Terms:
Since anp=2apa1a_{np} = 2a_p - a_1 must hold for any nn, it implies that a2p=a3p==anpa_{2p} = a_{3p} = \ldots = a_{np} for any prime pp. This suggests that the terms akpa_{kp} for k2k \geq 2 are all equal.

4. Further Analysis with Different Sequences:
Now, consider the sequences b1=1,b2=2p,b3=4pb_1 = 1, b_2 = 2p, b_3 = 4p and b1=p,b2=2p,b3=4pb_1 = p, b_2 = 2p, b_3 = 4p. For these sequences, the subsequences a1,a2p,a4pa_1, a_{2p}, a_{4p} and ap,a2p,a4pa_p, a_{2p}, a_{4p} must also form arithmetic progressions. This gives us:
a4p=2a2pa1anda4p=2a2pap a_{4p} = 2a_{2p} - a_1 \quad \text{and} \quad a_{4p} = 2a_{2p} - a_p
Since both expressions for a4pa_{4p} must be equal, we have:
2a2pa1=2a2pap 2a_{2p} - a_1 = 2a_{2p} - a_p
This simplifies to:
a1=ap a_1 = a_p
for any prime pp.

5. Conclusion:
Since a1=apa_1 = a_p for any prime pp, and we have already established that a2p=a3p==anpa_{2p} = a_{3p} = \ldots = a_{np} for any nn and any prime pp, it follows that all terms aia_i in the sequence must be equal. Therefore, the sequence a1,a2,a3,a_1, a_2, a_3, \ldots is constant.

The final answer is ai=c \boxed{ a_i = c } for some constant cc.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.