DMS - Tutorial Sheet - I

BIRLA INSTITUTE OF TECHNOLOGY
Department of Mathematics
Subject: CS 4101 : Discrete Mathematical Structures
Tutorial Sheet-I
1. Classify the following statements as propositions or non-propositions:
(i) The population of India goes upto 100 million in year 2000
(ii) x + y = 10
(iii) Go to Kolkata
(iv) The Intel Pentium-III is a 64-bit computer
2. Consider the following:
p : He is rich and q : He is generous
Write the new propositions using conjunction ( ∧ ), disjunction ( ∨ ), and negation (~).
3. Let p : It is warm day and q : The temperature is 37 0 C. Write in simple sentences the meaning of
the following:
(i) It is not a warm day (ii) It is false that it is warm day or temperature is 37 0 C.
(iii)It is not true that it is warm day and temperature is 37 0 C
(iv) It is false that it is not a warm day
( v) It is warm day or temperature is 37 0 C
(vi) It is warm day and temperature is 37 0 C
(vii) It is neither a warm day nor temperature is 37 0 C
(viii) It is false that it is not a warm day or temperature is not 37 0 C.
4. Consider the following statements:
p : Ramen is coward
q : Ramen is lazy
r : Ramen is rich
Write the following compound statements in the symbolic form:
Ramen is either coward or poor.
Ramen is neither coward nor lazy.
It is false that Ramen is coward but not lazy.
Ramen is coward or lazy but not rich.
It is false that Ramen is coward or lazy but rich.
It is not true that he is not rich.
Ramen is rich or else Ramen is both coward and lazy.
5. Translate the following statement into symbolic form:
‘If the utility cost goes up or the request for additional funding is desired, then a new computer
will be purchased if and only if we can show that the current computing facilities are indeed not
adequate’.
6. Construct the truth tables of the following:
(i) p ∧ ~ p (ii) p∨ ~ p (iii) ~(~p)
7. Construct the truth tables of the following:
(i) ~ ( p ∨ q ) (ii) ~ ( p ∨ ~ q) (iii) ( p ∧ q) ∨ ( p ∧ q) (iv) ( p ∨ q )∨ ~ p
8. Find the negation of propositions p and q
p : All people are intelligent and q : No student is graduate
9. If p : It is cold and q : It is raining, write simple verbal sentence which describes each of the
following statements:
(i) ~ p (ii) p ∧ q (iii) p ∨ q (iv) p ∨ ~ q
10. Express the following statement in symbolic form
‘If p implies q and q implies r then p implies r ’.
11. Show that p ∨ p ↔ p is a tautology.
12. Verify that proposition p∨ ~ ( p ∧ q) is a tautology
13. From the following formulae, find the tautology, contingency and contradiction:
(i) ( p ∧ ~ q ) ∨ (~ p ∧ q) (ii) ~ ( p ∨ q ) ∨ (~ p∧ ~ q )
14. Investigate the following as a tautology, contingency and contradiction:
(i) p → ( p → q ) (ii) p → ( q → p ) (iii) p ∧ ~ p
15. Let p : It is raining, q : It is Monday, and r : If it is raining then it is Monday or it is raining.
Express the proposition r in terms p and q and show that it is tautology.
16. Show that the following argument is invalid:
‘If I buy stocks, I will lose money, therefore I will lose money, I buy stocks’.
17. If p and q are false propositions, verify ( p ∨ q ) ∧ (~ p∨ ~ q ) as true or false.
18. Let the truth values of p and q be ‘T’, and that of r and s be ‘F’. Find the truth values of the
following: (i) p ∨ ( q ∧ r ) (ii) p → ( r ∧ s )
19. Write the contrapositive, converse and inverse of the following:
‘Indian team win whenever match is played in Kolkata, home town of Sourav Ganguly’.
20. Using the laws of propositions prove the following:
(i) ~ ( p ∨ q ) ∨ (~ p ∧ q ) ≡~ p (ii) ( p → q ) ∧ ( r → q ) ≡ ( p ∨ r ) → q
21. Prove that 2 n > n 2 , ∀n ≥ 5 .
22. Show that n 2 > 2n + 1 , ∀n ≥ 3 .
23. Prove each of the following statements, using the principle of mathematical induction:
(i) 6 n − 5n + 4 is divisible by 5 for all n ≥ 1 .
(ii) 1 + a + a 2 + a 3 + a 4 + .... + a n = (a n +1 − 1) /(a − 1) for all n ≥ 1 .
n 5 n 3 7n
24. Using principle of mathematical induction, prove that ∀n ∈ N , + + is a natural number.
5 3 15
25. Show, by principle of mathematical induction, that any positive integer n , greater than or equal to 2 is
either prime or product of primes.
26. Let A = {2,3,4} and B = {3,4,5,6,7} . Assume a relation R from A to B such that ( x, y ) ∈ R
when a divides b (with zero remainder). Determine R , and its domain and range.
27. Let R be the relation on A = {1,2,3,4} defined by (a, b) ∈ R if a ≤ b , a, b ∈ A . Then determine
R , and its domain and range.
28. If A = {x, y , z} , B = { X , Y , Z }, C = {x, y} and D = {Y , Z } . R is a relation from A to B defined by
R = {( x, X ), ( x, Y ), ( y, Z )} and S is a relation from C to D defined by S = {( x, Y ), ( y, Z )} . Find
R ′, R ∪ S , R ∩ S and R − S .
29. If R be a relation in the set of integers Z defined by

R = {( x, y ) : x ∈ Z , y ∈ Z , ( x − y ) is divisible by 6}.
Then prove that R is an equivalence relation.
30. Consider the relation R on A = {4,5,6,7} defined by R = {(4,5), (5,5), (5,6), (6,7), (7,4), (7,7)} .
Find the symmetric closure of R .
31. Let R = {(1,2), ( 2,3), (3,1)} and A = {1,2,3} . Find the reflexive, symmetric and transitive closure
of R , using
(i) composition of relation R
(ii)composition of matrix relation R
(iii)graphical representation of R .
32. Consider a relation R whose directed graph is shown in Fig. . Determine its inverse R −1 and
complement R ′ .
33. Show that the relation ( x, y ) R(a, b) ⇔ x 2 + y 2 = a 2 + b 2 is an equivalence relation on the plane,
and determine the equivalence classes.
34. Let A = {1,2,3,4} . Investigate the following relations as a function from A to A :
(i) f = {(2,3), (1,4), (2,1), (3,2), (4,4)} (ii) g = {(3,1), (4,2), (1,1)}
(iii) h = {(2,1), (3,4), (1,4), (2,1), (4,4)} .
35. State whether or not each diagram in Fig.1 defines a function from A = {a, b, c} into B = {x, y , z} .
(i) (ii) (iii)
Fig.1
36. Is the following function one-one?

2n, if n is even
f : N → N where f (n) = 
n, if n is odd
37. Let A = {0,−1,1} and B = {0,1} . Let f : A → B where f (a ) = a . Is f onto?
38. Consider functions f : A → B and g : B → C . Prove the following:
(i) If f and g are onto functions, then g f is one-to-one.
(ii) If f and g are onto functions, then g f is an onto function.
39. Prove that f : N → N , where f ( x) = x 2 is injective (one-one), but the similar function g : Z → Z ,
where g ( x) = x 2 is not injective.
40. Show that the function f : R → R be defined as f ( x) = 2 x + 3 for all x ∈ R is both injective and
surjective functions
41 Let f : R → R be defined by f ( x) = 2 x − 3 . Also, f is one-to-one and onto; hence f has an inverse
−1 −1
function f . Find a formula for f .
42. If f : R + → R + and g : R + → R + are defined by formulae f ( x ) = x and g ( x) = 3 x + 1
+
∀x ∈ R , find f g and g f . Is f g = g f ?
1
43. If f : R → R and g : R → R be defined by f ( x) = x 3 − 4 x, g ( x ) = and h( x ) = x 4 , find
x +1
2
the following composition functions:

(i) ( f g h)( x) (ii) ( g g )( x) (iii) ( h g f )( x) (iv) ( g h)( x )
44. Let f : R → R be defined by
2 x + 1, x ≤ 0
f ( x) =  2
 x + 1, x > 0
Let g : R → R be defined by
3 x − 7, x ≤ 0
g ( x) =  3
x , x > 0
Then find the composition g f .
−1
45. Let A and B be two sets. If A → B is one-one onto, then show that f : B → A is also one-one
onto.
46. Let A = {1,2,3}, B = {a, b} and C = {r , s} . Also, f : A → B is defined by
f (1) = a, f (a) = 2, f (3) = b and g : B → C is also defined by g (a) = s, g (b) = r .
Determine g f : A → C .
47. Let A = [1,2,3,4} and B = {a, b, c, d } , and let f = {(1, a ), ( 2, a ), (3, d ), ( 4, c)} . Show that f is a
−1
function but f is not.
48. Show that the mapping f : R → R be defined by f ( x) = ax + b , where a, b, x ∈ R, a ≠ 0 is
invertible. Find its inverse.
____x____

DMS - Tutorial Sheet - I

Uploaded by

Copyright:

Available Formats

DMS - Tutorial Sheet - I

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DMS - Tutorial Sheet - I

Uploaded by

Copyright:

Available Formats

BIRLA INSTITUTE OF TECHNOLOGY

29. If R be a relation in the set of integers Z defined by

(i) (ii) (iii)

36. Is the following function one-one?

the following composition functions:

You might also like