CS201 Assignment 2

23rd January 2014 Kaviti Sai Saurab, 12349

Q2. To prove: If

is a positive integer and , . / . /

is a positive integer, then . / . /

We take that ( ) Now let us try to formulate an induction proof.

Induction hypothesis:
For any positive integer and for every positive integer , . / . / . / . /

Base case:
For and we have ( ) For any Here greater than . / , we have ( ) ( ) . / ( ) ( )

because then ( ) * +, . /

. Also

. Here cannot be cannot be less than For then and further

so as

. Hence this tuple is unique.

Inductive step:
Now assume that the induction hypothesis is true Note that ( ) ( ) ( ) ( )

Lemma 1:

( )

Proof:
Clearly for any Now if ( ( ) ) , then for we have ( ) ( ) Otherwise Else If ( ( ) because then ) and ( ) then for , we have ( ) ( ) . Otherwise

We can continue going on further and we are guaranteed to find an if then ( ) so this process will have to terminate. If ( ) ( ) So we have our

Clearly such an is unique. Assume there is another same relation. Since let But Again ( ( ) ) ( ( ) ) ( ). So ( ) . So

which can satisfy the because

cannot be greater than . Let cannot be less than . Hence is unique.

Now back to the induction proof. We claim that . . / . . Since and / . / / . / . / ( )

from induction hypothesis I have a unique representation for .

Now we claim that this is the only possible choice. For if then maximum values that . / . / , but ( ). And if )( can take are ( ( ) ( ) then the ) ( )

. /

. /

. /

. /

Hence is the only choice possible. And since from lemma is unique , therefore is unique. Hence we have a unique of positive integers satisfying the condition. From this we can conclude that theorem is true for all positive integers

Q4. Consider the cyclic permutations of elements of

. Consider one of the permutations . Let us represent it as [ ]. Cyclic permutations are unchanged under rotation. That means [ ] is same as [ ] and [ ]. That means if we are considering cyclic permutations of elements ; for any one cyclic permutation [ ] there are equivalent representations each obtained by shifting the sequence towards the left. If we shift (or you can say rotate) the sequence towards the left once we get [ ]. These both represent the same cyclic permutation. In this way we have distinct representations of the same cyclic permutation each obtained by shifting once subsequently towards left. Let us define the set of all cyclic permutations of by Consider the set of all possible representations of these cyclic permutations by . So we have established that, | | | |

because each cyclic permutation has distinct representations. Now consider the set Each element of this set can be seen as a linear permutation of . And from each distinct linear permutation of we can construct a distinct representation of a cyclic permutation. Hence, we have | | | |

| | | | ( ) elements is ( )

Hence number of cyclic permutations of

Q7. A relation is a subset of the cross product of two sets. Cross product of
two sets and , *( )| +. Therefore, a relation *( | | = ( ) )| will be a subset of the cross product +

Number of relations = Number of subsets of i. A relation on is reflexive if

Consider a reflexive relation. Remove all elements from this which ) are of the form ( ) So now we only have elements of the form ( ( ) such elements. Now consider a set . Clearly there are of all these elements. If I consider any subset of this set and add to it all elements of the form ( ) then the resultant set will be a reflexive relation. Hence ii. Number of reflexive relations = | | = ( ) A relation on is symmetric if ( ) Consider set , the set of all unordered pairs , . Elements of can be divided into two sets. *, -| + *, -| + | | | | ( ) Now can construct symmetric relations from this in the following way. For every element of , we have choices to include it or not in our symmetric relation. Similarly for every element of we can ) choose it by including both ( ( ) or not include it.
( )

iii.

For constructing a relation that is symmetric and reflexive we have only choice for elements of , to include all of them. And for elements of we may include them by considering both ( ) ( ) or exclude them. So 2 choices.
( ) ( )

iv.

Hence, no. of symmetric reflexive relations = An antisymmetric relation informally, can only have one of (

and ( ) if or if an antisymmetric relation contains ( ) and ( ) then . So let us look at how can we construct a set . Consider elements of the set that we defined before. Now for every element , - of we have 3 choices: 1. Do not use that element for ) in 2. Put ( 3. Put ( ) in And similarly for every element [ 1. Do not include , 2. Include , ] of we have 2 choices:

So if we iterate over the space of all elements and all choices we can generate all possible antisymmetric relations.
( )

No. of antisymmetric relations =