The set can be partitioned into 27 sets
Source:
August 29, 2010
combinatorics proposedcombinatorics
Problem Statement
Prove that the set can be partitioned into disjoint sets so that no one of these sets contains an arithmetic triple (i.e., three distinct numbers in an arithmetic progression).