Name: Rajat Chowdhry Roll Number: 520810922 Learning Centre: 2017 Subject Code: BC0039 Subject: Discrete Mathematics

Assignment No.: 1 Course: Bachelor Of Computer Application (II Semester) Date of Submission at the Learning Centre: 8th June, 2009

Ques. 1.

If A = {x: x2 5x + 6 = 0}, B = {2, 4} C = {4, 5} then find (AB) (BC)

Ans. x2 - 5x + 6 = 0

x2 - 2x - 3x + 6 = 0 (x - 2) (x - 3) = 0 x = 2, 3 A={2,3} B={2,4} C={4,5} A B = {3} and B C = {2}

Therefore (A - B) X (B - C) = (3) X (2) = (3, 2)

Ques. 2. Ans.

Let Q be the set of rational. If f:QQ is defined by f(x) = 5x 4 for every x Q then find f 1 if it exists.

(a) Let f(x1) = f(x2) 2x1 3 = 2x2 3 x1 = x2 Hence f is one one (b) Let y Q. Then to find x q : f(x) = y i.e., 2x 3 = y therefore x = y + 3 is also a rational. Hence there exists y + 3 Q such that f y + 3 = y Hence f is onto. Therefore f-1:QQ exists Let x = f-1(y) i.e., y = 2x 3 or Therefore y = f(x) x=y+3

Define f-1:QQ by f-1(y) = y + 3 for every y Q. Replacing y by x, we get f-1(x) = x + 3 x Q. This is required inverse function.

Ques. 3.

Using mathematical induction prove that

13 + 2 3 + 33 + ...... + n 3 =
Ans.

n 2 ( n + 1) 2 4

(a) For n=1, left side = 13 =1 right side = 12 (1+1)2 = 1.4 = 1 Hence, it is true for n=1 (b) Assume the result to be true for n = m Then 13 + 23 + 33 + _ _ _ _ _ _ + m3 = m2 (m+1)2

(induction hypothesis)

Adding the (m+1)th term viz., (m+1)3 to both sides 13 + 23 + 33 + _ _ _ _ _ _ _ +m3 + (m+1)3 = m2 (m + 1)2 + (m + 1)2 = (m + 1)2 (m2 + 4m + 4) = (m + 1)2 (m + 2)2 = (m + 1)2 (m + 1 + 1)2 Therefore, the result is true for n = m + 1. Hence by mathematical induction the given result is established for all positive integers.

Ques. 4.

How many 3 digit numbers can be formed by using the digits 2, 3, 5, 6, 7, 9 repetitions not being allowed? i) How many of these are less than 400? ii) How many of these are even? iii) How many of these are multiples of 5?

Ans.

Total number. of ways of arranging to form 3 digits number. 6! = 120 ways i) ii) iii) We can fill first place in 2ways by putting 2 or 3 => 2 X 5 X 4 = 40 ways. We can fill last place by planning either 2 or 6 Of arrangement = 4 X 5 X 2 = 40 ways. X 10.

We can fill last place by placing 5. No. of ways of arrangements = 4 X 5 X 1 = 20 ways.

Ques. 5. Ans.

Explain in your own words The problem of tower of Hanoi.

A tower of eight disks initially stacked in decreasing size on one of the 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). The French mathematician Edouard Lucas invented this in 1883. Let Tn be the minimum number of moves that will transfer n disks from one peg to another under Lucas rules. Then clearly T0 = 0, since no moves are needed to transfer a tower of n = 0 disks. Now transfer the top disks to the middle peg, then move the third, then bring the other two onto it. So we get T3 = 7 = 2.3 + 1 = 2T2 + 1. Induction hypo: Assume for n-1 disks. i.e., Tn-1 = 2Tn-2 + 1. Suppose that there are n-disks. We first transfer the (n 1) smallest disks to a different peg. It requires Tn-1 moves. Then move to largest (it requires one move), and finally transfer the (n-1) smallest disks back onto the largest (it requires another Tn-1 moves). Thus we can transfer n disks (n > 0) in at most 2Tn-1 + 1 moves. Thus Tn 2Tn + 1 for n > 0. This shows that 2Tn-1 +1 moves are suffices for our construction. Next we prove that 2Tn-1 + 1 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 Tn-1 moves to put them there (we might move the largest disk more than once). After moving the largest disk for the last time, are must transfer the n-1 smallest disks (which must be again on a single peg) back onto the largest; this requires Tn-1 moves. Hence Tn => 2Tn-1 + 1 for n > 0 Therefore T0 = 0 Tn = 2Tn-1 +1 for n > 0 This set of equalities above is the recurrence for the tower of Hanoi problem. From this it is clear that T3 = 2.3 + 1 = 7, T4 = 2.7 + 1 = 15, and so on

Ques. 6. Ans.

Let a and b be two elements in a lattice (L, ). Show that a b = b if and only if ab = a

(a)

Suppose a b = b. Now a = a (a b ) = a b a b = a Supposed now b = b (b a) = b (a b) = b a = a b

(by absorption law) (supposition)

(b)

(by absorption) (by commutative) (supposition) (by commutative)