Important Question -Discrete Mathematics

1.(i) ) Find PCNF and PDNF of (P  R)  (Q  P) without using truth table. (8)
(ii) Show that the premises “ One student in this class knows how to write programs in JAVA”
and “Everyone who knows how to write programs in JAVA can get high paying job” imply the
conclusion “Someone in this class can get a high paying job”. (8)
2.(i) Find PCNF and PDNF of (P  R)  (Q  P) without using truth table. (8)

(ii) Show that the premises “ A student in this class has not read the book” and Everyone in this
class passed the semester exam” imply the conclusion “Someone who passed the Semester Exam
has not read the book”. (8)

3.(i) Without using truth table find PCNF and PDNF of P  (Q  R)  (P  (Q  R)). (8)

(ii) Use the rules of inference to show that the hypothesis "If it does not rain or if it is not foggy ,
then the sailing race will be held and the lifesaving demonstration will go on", " If the sailing
race is held , then the trophy will be awarded " and " The trophy was not awarded " imply the
conclusion " It rained".(8)

4.(i) Find PCNF and PDNF of (P  R)  (Q  P) without using truth table. (8)

(ii) Show that  x   P  x   Q  x     x  Q  x   R  x     x   P  x   R  x   . (8)

5. (i) Obtain the PDNF and PCNF of the statement P(P→(Q(Q→R))). (8)

(ii) Prove that (x)( p( x)  q( x))  (x) p( x)  (x)q( x) using indirect method. (8)

6.(i) Prove by principle of mathematical induction, for n positive integer,

n(n  1)( 2n  1)
12  2 2  .....  n 2  . (8)
6
(ii) How many integers between 1 to 1000 that are not divisible by 7,11,or 13
(8)
7.(i) Prove, by mathematical induction, that for all n≥1, n3+2n is a multiple of 3. (8)
(ii) Out of 100 students in a college, 38 play tennis, 57 play cricket and 31 play hockey, 9 play
cricket and hockey, 10 play hockey and tennis, 12 play tennis and cricket. How many

(1) All three games.

 (2) Just one game.

(3) Tennis and Cricket but not Hockey.

(Assume that each student play at least one game). (8)

8.(i) Prove by mathematical induction that 11n1  122 n1 is divisible by 133. (8)
(ii) Find the numbers between 1 to 250 that are not divisible by any of the integers 2, 3, 5 and 7.
(8)
9.(i) Prove by principle of mathematical induction, for n positive integer,
n(n  1)( 2n  1)
12  2 2  .....  n 2  . (8)
6

(ii) A survey of 100 students with respect to their choice of the ice cream flavours Vannila,
Chocolate and Strawberry. Show that 50 students like Vannila, 43 like Chocolate, 28 like
Strawberry, 13 like Vannila and Chocolate , 11 like Chocolate and Strawberry, 12 like
Strawberry and Vannila and 5 like all of them. Find the number of students who like

i) Vannila only ii) Chocolate only iii)Strawberry only

iv) Chocolate but not strawberry. v)Chocolate and Strawberry but not Vannila. vi)
Vannila or Chocolate but not Strawberry and

also find the number of students who do not like any of these flavours. (8)

10.(i) Prove that a n  b n is divisible by a  b using mathematical induction. (8)

(ii) Find the number of integers between 1 and 500 that are not divisible by any of the integers 2,
3, 5 and 7.. (8)
11.(i) Prove that a simple graph with n vertices and k components cannot have more than
 n  k  n  k  1 edges. (8)
2

(ii) ) Prove that a nonempty connected graph is Eulerian if and only if all vertices of G are of
even degree. (8)

12.Prove that a nonempty connected graph is Eulerian if and only if all vertices of G are of even
degree. (8)
13.(i) Prove that a simple graph with n vertices must be connected if it has more than
(n  1)( n  2)
edges. (10)
2
(ii) Find an Euler path or an Euler circuit, if it exists in each of the three graphs below. If it does
not exist, explain why? (6)

14.Give an example of a graph which is

a) Eulerian but not Hamiltonian

b) Hamiltonian but not Eulerian
c) Both Hamiltonian and Eulerian.
d) Neither Hamiltonian nor Eulerian. (8)

15. Find an Euler path or an Euler circuit for the following graph, if it exists. If it does not exist,
explain why?

(8)
16.(i) Prove that the order of a subgroup of a finite group is a divisor of the order of the group.
(8)
(ii) Find the left cosets of the subgroup H   0 , 3 , of the group (Z6, +6) and find their union.

(8)
17. If S  N  N , the set of ordered pairs of positive integers with the operation  defined by
a
 a, b    c, d    ad  bc, bd  and if f :  S ,   Q,   is defined by f  a, b   , show that f
b
is a semigroup homomorphism. (8)

18. Find all the subgroups of (Z9, +9). (8)

19. Prove that the set Z 4  [0],[1],[2],[3] is a commutative ring with respect to the binary

operation + 4 , 4 . (8)
20. If S  N  N , the set of ordered pairs of positive integers with the operation  defined by
a
 a, b    c, d    ad  bc, bd  and if f :  S ,    Q,   is defined by f  a, b   , show that f
b
is a semigroup homomorphism. (8)
21. Let L,,  be a lattice in which  and  denote the operation of meet and join respectively,
show that a  b  a  b  a  a  b  b for any a, b  L . (8)
(ii)Prove that every chain is a distributive lattice. (8)
22. Show that in a distributive lattice prove that a * b  a * c and a  b  a  c imply b  c. (8)
23.(i) Show that in a distributive and complemented lattice a  b  a * b '  0  a ' b  1 
b '  a '. (8)
(ii) Define modular lattice and prove that every distributive lattice is modular but not conversely.
(8)
24. In a Boolean Algebra. Show that (𝑎 + 𝑏 ′) (𝑏 + 𝑐 ′) (𝑐 + 𝑎 ′) = (𝑎 ′ + 𝑏)(𝑏 ′ + 𝑐)(𝑐 ′ + 𝑎). (8)
25. Show that in a distributive and complemented lattice
a  b  a * b '  0  a ' b  1  b '  a '. (8)
(ii). State and prove Isotonicity property of lattice (8)