Problem

Source:

Tags: AMC, USA(J)MO, USAMO, induction, algebra unsolved, algebra



Determine the maximum number of three-term arithmetic progressions which can be chosen from a sequence of $n$ real numbers \[a_1<a_2<\cdots<a_n.\]