CS 201: Combinatorics Assignment 1

Name: Kaviti Sai Saurab Roll number: 12349

Problem 5: a. Define as ( ) odd number of elements. is one-one: Consider such that ( ) ( ) . Observe that has an

Notice that here is the same as complement of w.r.t . Hence we can conclude, Hence is onto: Consider . That means has an odd number of elements. Consider ( ) Since has an odd number of elements so will clearly have an even number of elements. Since is the set of all even-element subsets of . So Also (True because so has no elements outside of . So we have an such that ( ) . Hence is onto. From above is one-one and onto. Hence it is a bijection. Therefore | | | |. is one-one.

b. Consider as described in the hint. is the set of all even element subsets containing and is the set of all even element subsets of not containing . Similarly are the partitions with respect to odd element subsets. So, are respectively the set of all even and odd element subsets of * + * +. Now since elements of are even-element sets and definitely contain , they can be expressed as * + where is an odd-element subset of or Similarly every element of can be expressed * + where as . Define as follows: * + ( )) * + ( Clearly the map on elements of is to the elements of and is same as the map of the previous problem and hence is a bijection. And observe the map on the elements of . It essentially is the map where does composition of functions and * + is ( ) ; ( ) is ; and * + is ( ) . Clearly, since are bijective, hence their composition is bijective. Hence is bijective on both the domains on which it is defined. So is a bijective map. Hence again we have that | | | |. c. In both parts (a) and (b) was the set of even-element subsets of and was the set of odd-element subsets of . We know that number of ways in which we can pick elements from a set of elements is ( ) Even element subsets have 0 or 2 or 4 or 6 elements of . And odd-element subsets would have 1 or 3 or 5 or 7 elements of . So number of even-element ( ) {

subsets would be the number of ways we can pick 0 or 2 or 4 or elements of if has elements, then | | ( ) ( )+( ) ( ) ( ) ( ) ( ) ( )

Similarly, | |

In part (a), contained odd number of elements and in part (b) had even number of elements. In both parts we have proved that | | | |. So, ( ) ( )+( ) ( ) ( ) ( ) ( )

Hence Proved.