k>1 is fixed. Show that for n sufficiently large for every partition of {1,2,…,n} into k disjoint subsets we can find a=b such that a and b are in the same subset and a+1 and b+1 are in the same subset. What is the smallest n for which this is true? Subsetspartitioncombinatorics