Source: MTRP 2016 Class 11-Short Answer Type Question: Problem 6 :-
May 31, 2020
partitioncombinatorics
Problem Statement
Consider the set A={1,2,3,4,5,6,7,8,9}.A partition Π of A is collection of disjoint sets whose union is A. For example, Π1={{1,2},{3,4,5},{6,7,8,9}} and Π2={{1},{2,5},{3,7},{4,5,6,7,8,9}} can be considered as partitions of A. For, each Π partition ,we consider the function π defined on the elements ofA. π(x) denotes the cardinality of the subset in Π which contains x. For, example in case of Π1 , π1(1)=π1(2)=2, π1(3)=π1(4)=π1(5)=3, and π1(6)=π1(7)=π1(8)=π1(9)=4. For Π2 we have π2(1)=1, π2(2)=π2(5)=2, π2(3)=π2(7)=2 and π2(4)=π2(6)=π2(8)=π2(9)=4 Given any two partitions Π and Π′, show that there are two numbers x and y in A, such that π(x)=π′(x) and π(y)=π′(y).[Hint: Consider the case where there is a block of size greater than or equal to 4 in a partition and the alternative case]