Rohit.

Kumar Roll No: 520776763 BCA 2nd Semester BC0039 01 Discrete Mathematics

Question 1 - Prove that the relation a b (mod m) is an equivalence relation? Ans. Reflexive relation: Let az. since m divides a-a=0, we have aa mod m. Symmetric relation: let ab mod m M divides a-b M divides (a-b) M divides b-a Ba mod m Transitivity relation: let a, b, cZ such that ab mod m , b c mod m M divides a-b, and m divides b-c M divides (a-b) + (b-c) M divides a-c A c mod m, hence the relation is equivalence relation

Question 2 - Prove that Ans.

.+

For n = 1, left side = Right side =

=1

Hence it is true for n = 1 Assume the result to be true for n = m Then Adding the ..+ = term to both sides,
1

(induction hypothesis)

= = = =

/4 /4

Therefore the result is true for n = m+1. Hence by mathematical induction the given result is established for all +vet integers.

Question 3 - Prove that the number of partitions of n in which no integer occurs more than twice as a part is equal to the number of partitions of n into parts not divisible by 3. Ans. The generating function corresponding to no integer occurs more than twice is (1+x+ (1+ ----------(1)

The generating function corresponding to no part is divisible by 3 is ---------------- (2) 1(1-x)(1+x+

Therefore (1) becomes (1=

For instance, take n=6. The partition in which no integer occurs more than twice are 6,51,42,411,33,321,221,1 (these are 8 in numbers). The partitions in which no Part is divisible by 3 are 51, 42, 411, 222, 2211, 2 Question 4 - Discuss about The problem of tower of Hanoi in your own words. Ans. Given a tower of eight disks, initially stacked in decreasing size on one of three pegs. The objective is to transfer the entire tower to one of the other pegs, moving only one disk at a time and never moving a larger on to smaller(these rules are called Lucas Rules) (this was invented by the French mathematician Eduard Lucas in 1883)
2

Let minimum no of moves that will transfer n disks from one to another peg Lucas rule Then clearly observation, since no moves are needed to transfer a tower of n=0 disk. By

Now transfer the top disk to the middle peg, then move the third, then bring the other onto it. So we get . We first transfer the (n-1) smallest disks to a different peg. It requires moves. Then move the largest (it requires one move), and finally transfer the (n-1) smallest disks back onto the largest (it requires another moves). Thus for n>0 This show that moves are suffices for our construction. Next we prove that moves are necessary .We must move the largest disk. When we do, the n-1 smallest disks must be on a single peg, and it has taken at least moves to put them there (we might move the largest disk more than once).After moving the largest disks for the last time, we must transfer the n-1 smallest disk (which must be again on a single peg) back on to the largest; This requires moves .Hence for n>o. Therefore 0, +1 for n>0. These set of equalities above is the recurrence for the Tower of Hanoi problem. From this it is clear that t and so on.

Question 5 - Prove that If L is a distributive lattice, and then it is a modular lattice. Ans. Assume that L is a distributive lattice. Let x, y, zL and x z. We have that (x ^ y)v(y ^ z)v(z ^ x)=(x v y)^(y v a)^(z v x). Since x z, we have that x ^ z=z and x v z=z, and so (x ^ y)v(y ^ z)v x=(x v y)^(y v z)^z This implies xv(y v z) =(x v y)^z (by absorption laws). This shows that L is a modular lattice.

Question 6 - Prove that the set of real numbers is a group with respect to multiplication.

Ans. Let R be a set with respect to a multiplication Let <R,*> be an algebraic system. If R is a group it must satisfy following property. 1. Closure operation: For any a, b, R; Then a*bR; hence * is closure operation for R. 2. Associative Operation: For a,b,cR; Then a*(b*c)=(a*b)*c a*(b*c) = (a*b)*c; hence * is an associative operation on R. 3. Identity For any aR a*e=e*a=e=1; Identity element 4. Inverse For any aR; Inverse of a is equal to 1/a; Because, a*1/a = e= 1; identity element Therefore <R,*> is a group.