MathDB
Sets

Source:

January 15, 2014
symmetrycombinatorics unsolvedcombinatorics

Problem Statement

Let U={1,2,,2014}U=\{1, 2,\ldots, 2014\}. For positive integers aa, bb, cc we denote by f(a,b,c)f(a, b, c) the number of ordered 6-tuples of sets (X1,X2,X3,Y1,Y2,Y3)(X_1,X_2,X_3,Y_1,Y_2,Y_3) satisfying the following conditions: (i) Y1X1UY_1 \subseteq X_1 \subseteq U and X1=a|X_1|=a; (ii) Y2X2UY1Y_2 \subseteq X_2 \subseteq U\setminus Y_1 and X2=b|X_2|=b; (iii) Y3X3U(Y1Y2)Y_3 \subseteq X_3 \subseteq U\setminus (Y_1\cup Y_2) and X3=c|X_3|=c. Prove that f(a,b,c)f(a,b,c) does not change when aa, bb, cc are rearranged.
Proposed by Damir A. Yeliussizov, Kazakhstan