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.\]
Problem
Source:
Tags: AMC, USA(J)MO, USAMO, induction, algebra unsolved, algebra
22.05.2012 02:01
5/4: Possibly using or with help from http://mks.mff.cuni.cz/kalva/usa/usoln/usol802.html
22.05.2012 03:04
Mrdavid445 wrote: Determine the number of three-term arithmetic progressions which can be chosen from a sequence of $n$ real numbers $a_1<a_2<\cdots<a_n$. The actual problem statement reads, Quote: Determine the maximum number of different three term arithmetic progressions which can be chosen from a sequence of $n$ real numbers $a_1 < a_2 < \dots < a_n$. Emphasis was added. There is a major difference between this and the problem as written here!
16.04.2023 08:02
I think the answer has the triples (a_1, a_2, a_3), (a_2, a_3, a_4), …, (a_1, a_3, a_5), … Which can be verified by the sequence a, a+r, a+2r, etc. So it should be (n-2)+(n-4)+(n-6)+…(n-2x)=n*floor[n/2]-(2+2floor[n/2])/2*floor[n/2]=floor[n/2](n-(1+floor[n/2])). Also this should be easy to prove by induction.