DM Internal-I - Solutions

Download as pdf or txt
Download as pdf or txt
You are on page 1of 7

Duration: 90mins

Discrete Mathematics (with Solutions)

45 Marks

Instructions: 1. Question 1 is compulsory and carries 9 marks. 2. Attempt any FOUR questions from rest of the SEVEN question & are equally marked 9 each 3. Only First FIVE attempted questions are considered for score, in case you attempt sub parts of any other questions then that will not marked. 4. Attempt all the parts of a question together ONLY; otherwise will not be considered for marking. Q1. Define any NINE of the following: (1 Mark each) a) Ordered Set f) Symmetric Relation b) Power Set g) Equivalence Relation c) Paradox h) Partial Ordering Relation d) Contingency i) Cardinality e) Law of Detachment j) Law of Syllogism Solution 1: a) Ordered Set: A set in which the sequence of elements has some relevance or we can say that ordered collection of distinct objects is called an ordered set. b) Power Set: A set of all possible distinct subsets of a given set is called a power set. It is denoted by P(A) c) Paradox: Paradoxes are self-referential statements and these are not regarded as propositions because their truth values are not well defined i.e. may be true or false, cant state that. d) Contingency: A proposition that is neither always true nor always false; i.e. the proposition that is neither a tautology nor contradiction is called a contingency. e) Law of Detachment: It is also known as Modus Ponens, it says that if p=>q is true and p is true, then q must be true. f) Symmetric Relation: A relation R defined on non-empty set A is said to be a symmetric relation if for any x, y A, if (x, y) R then (y, x) R i.e. x R y y R x g) Equivalence Relation: A relation R defined on non-empty set A is said to be an equivalence relation if R is reflexive i.e. x A, (x, x) R R is symmetric i.e. whenever (x, y) R then (y, x) R R is transitive i.e. if (x, y) & (y, z) R then (x, z) R h) Partial Ordering Relation: A relation R on a set S is called a partial ordering or a partial order if R is reflexive, antisymmetric and transitive. i) Cardinality: It is defined by the number of elements in a given set. j) Law of Syllogism: It is also called the Law of Transitivity and it states that if p q and q r are both true, then p r is true. Q2. (a) What are the Quantified Statements? State & describe its two types with the help of two examples each. (b) How many numbers are there between 100 and 1000 which have exactly one of their digits as 7? (c) Prove the sum of first n odd integers is n2; i.e. 1 + 3 + 5 + 7 + ... + (2n - 1) = n2 for all positive integers (3 Marks each) Solution: (a) Those statements which consist of Quantifiers such as every, some, many, few, most, half and no, etc are called Quantified Statements. There are two types: Universal and Essential.

The universal quantification of P(x) is the proposition "P(x) is true for all values of x in the universe of discourse." The notation x P(x) denotes the universal quantification of P(x), and is expressed as for every x, P(x). The existential quantification of P(x) is the proposition "There exists an element in the domain (universe) of discourse such that P(x) is true." The notation x P(x) denotes the existential quantification of P(x), and is expressed as there is an x such that P(x) is true.

(b) A number between 100 and 1000 contains 3 digits, so we have to form 3 digits numbers having exactly one of their digits as 7 such type of numbers can be divided into three types. (i) Those numbers that have 7 in the unit place only. (ii) Those numbers that have seven at the tens place only. (iii)Those numbers that have 7 at the hundred place only. (i) When num is at unit place only. The hundred's place can have any one of the digits from 0 to 9 except 0 and 7. So, hundred's place can be filled in 8 ways. The tens place can have any one of the digits from 0 to 9 except 7. So, the num of ways the tens place can be filled is 9. The unit place has 7. So, it can be filled in only 1 way. Thus, there are 8x9x1=72 numbers of the first kind. (ii) Those three digits numbers that has 7 in the ten's place but not in any other place. The number of ways to fill the hundred place is 8, the number of ways to fill the tens place =1 (by 7 only) and the number of ways to fill the one's place is 9. Thus, there are 8x1x9 = 72 numbers of the second kind. (iii) Those three digits numbers that have 7 in the hundreds place but not at any other place. In this case, the hundred's place can be filled only in one way and each of the tens and once place can b filled in 9 ways. So, there are 1 x 9 x 9 = 81 numbers of the third kind. Hence, the total number of required type of numbers is 72 + 72 + 81 = 225. (c)

Q3. (a) Use the characteristic equation to solve the following recurrences a n = 6a n-1 9a n-2 for n 2 where a 0 = 2 and a 1 = 3 (b) If f(x) = 2x+1 and g(x) = x2 2. Find fOg and gOf. (c) Construct the truth table for the following: (p q) (p q) is contingency Solution: (a)

(3 Marks each)

(b) Given: f(x) = 2x + 1 and g(x) = x2 2 fOg(x) = f(g(x)) = 2. g(x) + 1 = 2(x2 2) + 1 = 2x2 3 gOf(x) = g(f(x)) = (f(x))2 2 = (2x+1)2 2 = 4x2 + 4x 1 (c) Truth Table p q pq p p q T T T F F T F F F T F T T T T F F T T F It is neither Tautology nor contradiction, so Contingency.

(p q) (p q) F F T F

Q4. (a) A survey among 1000 people; 595 are democrats, 595 wear glasses and 550 like chocolates. 395 of them are democrats who wear glasses, 350 of them democrats who like chocolates. 400 of them wear glasses and like chocolates and 250 all of three. (i) How many of them are not democrats, dont wear glasses and dont like chocolates? (ii) How many of them are democrats who dont wear glasses and dont like chocolates? (b) Show that the function f(x) = x4 and g(x) = x for x R are the inverses of one another. (c) How many numbers greater than 1000, but not greater than 4000 can be formed with the digits 1, 2, 3, 4, 5 if: (i) repetition of digits is not allowed & (ii) repetition of digits is allowed. (3 Marks each) Solution: (a) Let |D| = 596, |G| = 595, |C|=550, |D G| = 395, |G C| =400, |D C| =350, |D G C| = 250 |D U G U C| = 596 + 596 + 550 395 400 350 + 250 = 845 (i) |People neither democrats nor glasses nor chocolates| = 1000 845 = 155 (ii) |Democrats dont like chocolates and dont wear glasses| = |D| - |D G| - |D C| + |D G C| = 596 395 350 + 250 = 100 (b) Two functions are inverses of each other if their composition is I x . fOg(x) = f(g(x)) = f(x ) = (x )4 = x = I x . gOf(x) = g(f(x)) = g(x4) = (x4) = x = I x . Hence, f = g-1 and g = f-1. (c) Every number between 1000 and 4000 is a 4 digit number; in thousands place, we can put either 1 or 2 or 3 but not 4. So, thousand's place can be filled in three ways.

(i) As discussed above thousand's place can be filled in 3 ways, since repetition of digits is not allowed, so, hundred's place can be filled from the remaining digits in 4 ways. Now, 3 digits are left, so tens place can be filled in 3 ways, one's place can be filled in 2 ways. Hence, required numbers of numbers = 3 x 4 x 3 x 2 = 72. (ii) Since repetition of digits is allowed, so each of the hundred's, ten's and one's place can be filled in 5 ways. So, total number of numbers between 1000 & 4000 including 1000 and excluding 4000 is 3 x 5 x 5 x 5 = 375 but we have to find the total numbers of numbers greater than 1000 but not greater than 4000. Hence required number of numbers =375 + 1 (for 4000) 1 (for 1000) = 375. Q5. (a) Let R be a relation from set A to set B and let P and Q be subsets of A then prove that R(P Q) = R(P) R(Q) iff R(a) R(b) = for any a, b A and a b (b) Solve the following recurrences: a n = 5a n-1 6a n-2 + 4n + 2n + 3 for n 2 where a 0 = 5 and a 1 = 19 Solution: y R(P Q) x P Q such that xRy x P and x Q such that xRy y R(P) and y R(Q) Therefore, R(P Q) R(P) R(Q) Now, Let y be any element of R(P) R(Q). Then x P sich that xRy and zQ such that zRy x must be equal to z since R(x) R(z) = for x z x P such that xRy and x Q such that xRy x P Q such that xRy Therefore, R(P) R(Q) R(P Q) y R(P Q) ------- (2) y R(P Q) ------- (1) (a) Let y be any element of R(P Q). Then (3 Marks) (6 Marks)

Y R(P) R(Q) y R(P) and y R(Q)

Combining inequality (1) and (2), we have the result. (b)

Q6. (a) For the following valid argument form

(3 Marks)

s ~ p, t s, ~s u q, p, t q r, r List the valid elementary argument form or inference rules that used to derive the conclusion. (b) Verify that, for all integers n 1, (6 Marks) (i) n3 + 5n is a multiple of 3. (ii) 5n 4n 1 is divisible by 16 Solution: (a)

(b) (i)

(ii)

Q7. (a) Prove n < 2n for all positive integers n. (b) Use truth tables and make the comment on the followings: (i) [(P Q) ^ (Q R) ] (P R) (ii) [(P Q) ^ (~ P R)] (Q R) (c) State whether the following are True or False: (i) If the implication P Q is true, then its converse is guaranteed to be true, too (ii) w Z, x Z, y Z, z Z. w + x = y + z. (iii) x N, p Z, p > 5 x2 1 (mod p). Solution: (a) (3 Marks each)

(b) (i) P

PQ

QR T F T T T F T T

(P Q) ^ (Q R) T F F F T F T T

PR T F T F T T T T

T T T T T T F T T F T F T F F F F T T T F T F T F F T T F F F T Conclusion: It is Tautology (ii) P T T

[(P Q) ^ (Q R) ] (P R) T T T T T T T T

Q T T

R T F

PQ T T

~P F F

~P R T F

(P Q) ^ (~ P R) T F

QR T T

[(P Q) ^ (~ P R)] (Q R) T T

T F T T F T F F T F F T T T T F T F T T F F T F T F F F F T Conclusion: It is Tautology (c) (i) FALSE (ii) TRUE

T F T T T T

T F T T F F

T F T T T F

T T T T T T

(iii) TRUE

Q8. (a) Consider the function f: N X N so that f(x, y) = (2x + 1) 2y 1. Show that function is bijective. (b) Let A 1 , A 2 , countable number of finite sets. Prove that the union S = U i A i is countable. (c) Prove: (A B) (A U B) and (A B) B (A U B) Solution: (a) Here, N = {0, 1, 2, . . .} and f: N x N For x, y N, f(x, y) = (2x + 1) 2y 1. Let a & b from N such that x = a and y = b. Therefore, 2a = 2x => 2a + 1 = 2x + 1 ----- (1) ----- (2) Similarly, 2y = 2b Multiplying these two equations, we get (2a + 1) 2y = (2x + 1) 2b (2a + 1) 2y 1 = (2x + 1) 2b 1 Hence, f(a, y) = f(x, y). Thus f is one to one function. Let assume, f(a, b) = 0 (2a + 1) 2b 1 = 0 (2a + 1) 2b = 1 Or (2a + 1) 2b = 20 .1 Since, (2a + 1) cant be even, hence 2b = 20 and (2a + 1) = 1 So we have b = 0 and a = 0 Therefore, f(a, b) = 0. Thus f is onto function. Hence, f is injective and surjective , thus f is bijective function. (b) First define the sets B i such that B i contains the elements of A i which dont belong preceding sets i.e. we define B 1 = A 1 and B 2 = A 2 \(A 1 U A 2 ) here B 2 consists of the elements of A 2 which are not in A 1 So on... B k = A k \(A 1 U A 2 U A 3 U . U A k-1 ) Then B i are disjoints and S = U i B i . Let b i1 , b i1 , b i2 , b i3 ,, b imi be the elements of B i . Then S= {b ij }. Let F: SN be defined as follows: f(b ij ) = m 1 + m 2 + m 3 + m 4 + + m i-1 + j If S is finite, then S is countable. If S is infinite then f is one to one correspondence between S and N. Thus S is countable. (c) Since every element in (A B) is in both A and B, it is certainly true that if x (A B) then x A; (3 Marks each)

hence (A B) A. furthermore, if x A, then x (A U B) so A (A U B). Similarly, (A B) B (A U B) Putting these together gives (A B) A (A U B).

You might also like