Given an integer m≥2, find the smallest integer k>m such that for any partition of the set {m,m+1,..,k} into two classes A and B at least one of the classes contains three numbers a,b,c (not necessarily distinct) such that ab=c. partitionSubsetsnumber theory