Problem

Source: Spanish Communities

Tags: combinatorics unsolved, combinatorics



Find the maximum number of increasing arithmetic progressions that can have a finite sequence of real numbers $a_1<a_2<\cdots<a_n$ of $n\ge 3$ real numbers.