# The Hidden Arithmetic Progression

Here is a set $$S$$ of numbers.

There is some subset $$X \subset S$$ such that all the elements of $$X$$ form an arithmetic progression when sorted.

What is the largest possible value of $$|X|$$?

Extra Credit: Minimize the time complexity of your solution.

×