For every integer r>1 find the smallest integer h(r)>1 having the following property: For any partition of the set {1,2,...,h(r)} into r classes, there exist integers a≥0,1≤x≤y such that the numbers a+x,a+y,a+x+y are contained in the same class of the partition. inequalitiesnumber theory unsolvednumber theory