Professional Documents
Culture Documents
DISCRETE MATHEMATICS
UNIT – I LOGIC AND PROOFS
PART - A
2. State the truth value of “If tigers have wings then the earth travels
round the sun”.
Sol. Let P: Tigers have wings have truth value F
Q: The earth travels round the sun have truth value T
Therefore, P Q has the truth value T.
7. Prove that P Q P Q
Sol.
P Q P PQ P Q (1) (2)
(1) (2)
T T F T T T
T F F F F T
F T T T T T
F F T T T T
Since (1) (2) are all true, it is tautology.
(1) (2)
(i.e) P Q P Q
8. Prove that P (Q R) ( P Q) R.
Sol. P (Q R) P (7Q R)
7P (7Q R)
(7P 7Q) R
7(P Q) R
(P Q) R.
(P P) (P P) P Q
(P Q)
((P Q))
PQ
is minimal functionally complete set.
P P (P P)
P
(P Q) (P Q) (P Q)
((P Q))
PQ
(P P) (P P) P Q
(P Q)
((P Q))
P Q
is minimal functionally complete set.
21. Symbolize the statement: “If Vani attends classes regularly and if either
she is attentive in the class or studies well then she gets the top grade.”
Sol. Let P: Vani attends classes regularly.
Q: She is attentive in the class
R: She studies well
S: She gets the top grade.
The given statement can be written as P (Q R) S.
Sol. The Quantifiers which are introduced to symbolize expressions such as “for some”,
“there is at least one” and “there exists some” is called Existential Quantifier.
Ex: Some men are clever.
Let M(x): x is a man
C(x): x is clever
Then the statement “Some men are clever” can be written as “There exists some x such
that x is a man and x is clever” and it is ( x) [M(x) C(x)]
36. Write the following statement in the symbolic form “Some monkeys have no tails”
Sol. Let M(x): x is a monkey
T(x): x has a tail
The given statement can be written as “There is an x such that x is a monkey and x has no tail”
and it is ( x) [M(x) 7 T(x)]
38. Symbolize : “For any x and for any y , if x is taller than y then y is not taller than x”
Sol. Let T(x,y) : x is taller than y.
The given statement can be written as “For any x and for any y, if x is taller than y then it is
not true that y is taller than x” and it is
( x) ( y)[T(x,y) 7 T(y,x)]
41. Symbolize : For any given positive integer, there is a greater positive integer.
Sol. Let P(x): x is a positive integer
G(x,y): x is greater than y
ANAND INSTITUTE OF HIGHER TECHNOLOGY
The statement can be written as “For any x, if x is a positive integer then there exists some y
such that y is a positive integer and y is greater than x” and it is ( x)[P(x) ( y)( P(y)
G(y,x))]
44. Symbolize: Every one who likes fun will enjoy each of these plays.
Sol. Let L(x) : x likes fun
P(y) : y is a play
E(x,y) : x will enjoy y.
The statement can be written as “For each x, if x likes fun and for each y, if y is a play, then x
enjoys y” and it is
( x)( y)[ L(x) P(y) E(x,y)]
45. Symbolize: Every one should help his neighbours or his neighbours will not help him.
Sol. Let N(x,y) : x and y are neighbours
H(x,y) : x should help y
P(x,y) : x will help y
The statement can be written as “For every person x and every person y, if x and y are
neighbors, then either x should help y or y will not help x” and it is ( x) ( y)[ N(x,y)
( H(x,y) 7 P(y,x))]
46. Symbolize : Every one who is healthy can do all kinds of work.
Sol. Let H(x) : x is a healthy person
W(y): y is a kind of work
D(x,y): x can do y
The statement can be written as “For all x, if x is healthy and for all y, if y is a kind of work
then x can do y” and it is
( x) ( y)[ H(x) W(y) D(x,y)]
PART - B
1. Prove that ((P Q) 7(7P (7Q 7R))) (7P 7Q) (7P 7R)
is a Tautology.
Sol. ((P Q) 7(7P (7Q 7R))) (7P 7Q) (7P 7R)
((P Q) 7(7P 7(Q R))) 7(P Q) 7(P R)
((P Q) (P (Q R)))) 7[(P Q) (P R)]
ANAND INSTITUTE OF HIGHER TECHNOLOGY
{Hint: A (B C) A (7B C)
7A (7B C)
ANAND INSTITUTE OF HIGHER TECHNOLOGY
(7A 7B) C
7(A B) C
(A B) C }
Now, 7A (P Q R) (P Q 7R) (P 7Q R)
7(7A) 7[(P Q R) (P Q 7R) (P 7Q R)]
A 7(P Q R) 7(P Q 7R) 7(P 7Q R)
A (7P 7Q 7R) (7P 7Q R) (7P Q 7R)
which is PCNF.
5. Obtain the PCNF of (7P R) (Q P) and hence find
its PDNF.
Sol. (7P R) (Q P)
(P R) (Q P) (P Q)
(P R) (7Q P) (7P Q)
[(P R) (Q 7Q)] [(7Q P) (R 7R)]
[(7P Q) (R 7R)]
(P R Q) (P R 7Q) (7Q P R) (7Q P 7R)
(7P Q R) (7P Q 7R)
(P Q R) (P 7Q R) (P 7Q 7R) (7P Q R)
ANAND INSTITUTE OF HIGHER TECHNOLOGY
8. Q R Rule P
9. R Rule T
10. R 7R Rule T
which is a contradiction.
1. P Q Rule P
2. Q R Rule P
3. P R Rule T
4. S 7R Rule P
5. R 7S Rule T
6. P 7S Rule T
7. 7P 7S Rule T
8. 7(P S) Rule T
9. P S Rule P
10. (P S) 7(P S) Rule T
which is a contradiction.
Sol. Argument
1. ( x)[P(x) Q(x)] Rule P
2. P(a) Q(a) Rule ES
3. P(a) Rule T
4. Q(a) Rule T
5. ( x)P(x) Rule EG
6. ( x)Q(x) Rule EG
7. ( x)P(x) ( x)Q(x) Rule T.
Argument
1. ( x) ( y)[S(x,y) W(x,y)] Rule P
2. ( y)[S(a,y) W(a,y)] Rule US1
3. S(a,b) W(a,b) Rule US2
ANAND INSTITUTE OF HIGHER TECHNOLOGY
UNIT 2 COMBINATORICS
PART A
1. Find the number of non-negative integer solutions of the equation x1 x2 x3 11
3. If seven colours are used to paint 50 bicycles, then show that at least 8 bicycles will be the
same colour.
4. State the Pigeonhole principle.
5. Find the no. of arrangements of the letters in SCIENCE. How many of these arrangements have
no adjacent E’s ?
6. Find n if n P13 :( n 1) P12 3 / 4
7. Solve the recurrence relation y(k) – 8y(k-1) + 16y(k-2) = 0 for k 2, where y(2) = 16 and y(3) = 80.
8. What is the solution of the recurrence relation +2 ?
9. How many students must be in a class to guarantee that atleast two students receive the same score
on the final exam if the exam is graded on a scale from 0 to 100 points.
PART B
1. Use mathematical induction to prove that 3n 7 n 2 is divisible by 8, for all n 1 .
2. Solve an 7 an 1 10an 2 6 8n with a0 1, a1 2 .
3. Find the generating function of Fibonacci sequence.
4. Determine the number of positive integers n ,1 n 2000 that are not divisible by 2, 3 or 5 but divisible by 7.
5. A bit is either 0 or 1. A byte is a sequence of 8 bits. Find the number of bytes. Among these
how many are (1) Starting with 11 and ending with 00.
(2) Starting with 11 but not ending with 00 or not starting with 11 but ending with 00?
6. Using mathematical induction, prove that 2 + 22 + …..+ 2n = 2n+1 – 2 for all non-negative integers n.
7. A question paper has 3 parts, Part A, Part B and Part C having 12, 4 and 4 questions respectively. A
ANAND INSTITUTE OF HIGHER TECHNOLOGY
student has to answer 10 questions from Part A and 5 questions from Part B and Part C put together
selecting at least 2 from each one of these two parts. In how many ways the selection of questions can
be done?
8. Using generating functions, solve the recurrence relation an 2 8an 1 15an 0 given that
a0 2, a1 8
24. Use mathematical induction to prove the inequality n<2n for all positive integer n.
25. What is the maximum number of students required in a discrete mathematics class to be sure that at
least six will receive the same grade if there are five possible grades A, B, C, D and F?
26. Suppose that there are 9 faculty members in the mathematics department and 11 in the computer
science department. How many ways are there to select a committee to develop a discrete
mathematics course at a school if the committee is to consist of three faculty members from the
mathematics department and four from the computer science department?
27. Use generating functions to solve the recurrence relation an 3an 1 4an 2 0, n 2 with the
initial condition a0 3, a1 2.
28. State and prove generalized Pigeon Hole Principle.
29. Solve the recurrence relation a n 2 6a n 1 9a n 3(2 n ) 7(3 n ), n 0 given that = 1 and = 4
30. Use mathematical induction to show that n3 – n is divisible by 3, for n Z+
31. Show that among any n+1 positive integers not exceeding 2n there must be an integer that divides
one of the other integers.
UNIT 3 GRAPHS
PART A
1. Define strongly connected graph.
2. Define isomorphism of two graphs.
3. Define complete graph and draw a complete bipartite graph of K2,3 and K3,3
4. Define Pseudo graph.
5. Obtain the adjacency matrix of the graph G.
PART B
1. Draw the complete graph K 5 with 5 vertices A, B, C, D, E. Draw all complete sub graph of K 5 with 4
vertices.
2. If all vertices of an undirected graph are each of degree k, show that number of edges of the graph is a
ANAND INSTITUTE OF HIGHER TECHNOLOGY
multiple of k.
3. Draw the graphs for K5 , C5
4. If the simple graph G has 6 vertices and 7 edges then how many edges does G have?
5. Determine whether the following graphs G and H are isomorphic. If the graphs are not isomorphic,
explain an invariant that the graphs do not share.
8. The adjacency matrices of two pairs of graph as given below. Examine the isomorphism of G
0 0 1 0 1 1
and H by finding a permutation matrix. AG 0 0 1 , AH 1 0 0
1 1 0 1 0 0
9. Examine whether the following pair of graphs are isomorphic. If not isomorphic, give the
reasons. V1 v2
u1 u2
v5 v3
u5 u3
u4 v4
ANAND INSTITUTE OF HIGHER TECHNOLOGY
10. Let G be a simple indirect graph with n vertices. Let u and v be two non adjacent vertices in G such that
deg(u) + deg(v) n in G. Show that G is Hamiltonian if and only if G + uv is Hamiltonian.
11. Find all the connected sub graph obtained from the graph given in the following Figure, by
deleting each vertex. List out the simple paths from A to in each sub graph.
B
A C
F D
E
12. Determine which of the following graphs are bipartite and which are not. If a graph is
bipartite, state if it is completely bipartite.2
G1 G2 G3
E F
E
A B C
D A D A
C B C B D E F
13. Using circuits, examine whether the following pairs of graphs G1 ,G2 given below are
isomorphic or not: v1 v4
A
D
D
B C v2 v3
G1 G2
14. Prove that the maximum number of edges in a simple disconnected graph G with n vertices
(n k )(n k 1)
and K components is .
2
15. 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? A
A B A B
F C B C
C D E
G1 E D E D
G2 G3
16. Prove that a connected graph G is Eulerian if and only if all the vertices are of even degree.
17. Show that the graph G is disconnected if and only if its vertex set V can be partitioned into
two nonempty subsets V1 and V2 such that there exists no edge in G whose one end vertex is
ANAND INSTITUTE OF HIGHER TECHNOLOGY
a b
c d
19. Show that the complete graph with n vertices Kn has a Hamiltonian circuit whenever n 3.
20. Determine whether the graphs G and H given below are isomorphic.
u1 u2 v1
uuuuuu v2 v3
v6
u4 u3 v5 v4
G H
21. Prove that an undirected graph has an even number of vertices of odd degree.
22. Draw a graph that is both Eulerian and Hamiltonian.
8. Let (M, , be a monoid and aM. If a invertible, then show that its inverse is unique.
9. Define a commutative ring.
10. State any two properties of a group.
11. Obtain all the distinct left cosets of {(0), (3)} in the group ( and find their union.
12. Show that the set of all elements ‘a’ of a group (G, ) such that ax = xa for every xG
is a subgroup of G.
13. Define semi group homomorphism.
14. Give an example of a commutative ring without identity.
15. Define Ring and give an example of a ring with zero-divisors.
16. How many generators are there in a cyclic group of order 10?
17. Show that is not a cyclic group.
18. Show that every cyclic group is abelian.
19. Define a Commutative Ring.
PART B
ANAND INSTITUTE OF HIGHER TECHNOLOGY
PART B
1. Let R be a relation on a set A. Then define R-1 = {(a, b) A A/(b, a) R}. Prove that if (A, R) is
poset then (A, R-1) is also a poset.
2. Is the poset (Z+, /) a Lattice?
3. Show that every finite partial ordered set has a maximal and minimal element.
4. Show that if L is a distributive lattice than for all a, b, c L,
(ab) (bc) (ca) = (a b)(b c)(c a)
5. Show that (N,) is a partially ordered set where N is set of all positive integers and is defined by m
n iff n – m is a non-negative integer.
6. In a Boolean Algebra, prove that (ab)’ = a’ b’.
7. In a Lattice (L, ), prove that x(yz) (xy)(xz).
8. If S42 is the set of all divisors of 42 and D is the relation “divisor of” on S42 , prove that
{S42, D} is a complemented Lattice.
9. Prove that Every distributive lattice is modular. Is the converse true? Justify your claim.
10. Show that the direct product of any two distributive lattices is a distributive lattice.
11. Draw the Hasse diagram for (1) P1 = {2, 3, 6, 12, 24} (2) P2 = {1, 2, 3, 4, 6, 12} and is a relation
such that xy if and only if x|y.
12. Prove that D110, the set of all positive divisors of a positive integer 110, is a Boolean algebra and find
all its sub algebras.
13. If P(S) is the power set of a set S and , are taken as join and meet, prove that (P(S), ) is a lattice.
Also, prove the modular inequality of a Lattice (L, ), viz for any a, b, c L, a c a (b c) (a
b) c.
14. In any Boolean algebra, show that ab’+a’b =0 if and only if a = b.
ANAND INSTITUTE OF HIGHER TECHNOLOGY
15. Prove that Demorgan’s laws hold good for a complemented distributive lattice (L, , ), viz (ab)’
=a’b’.
16. In any Boolean algebra, prove that the following statements are equivalent: (1) a + b = b
(2) a b = a (3) a’ + b = 1 and (4) a b’ = 0
17. Let B be a finite Boolean algebra and let A be the set of all atoms of B.
Then prove that the Boolean algebra B is isomorphic to the Boolean algebra P(A),
where P(A) is the power set of A
18. Draw the Hasse diagram representing the partial ordering {(A, B):AB} on the power set P(S) where
S ={a, b, c}. Find the maximal, minimal, greatest and least elements of the poset.
19. In a Boolean algebra, prove that a.(a+b)=a, for all a, b B.
20. In a distributive lattice {L, , } if an element a L a complement then it is unique.
21. Simplify the Boolean expression a’.b’.c+a.b’.c+a’.b’.c’ using Boolean algebra identities.
22. Show that in a lattice both isotone property and distributive inequalities are true.
Also show that in a distributive lattice cancellation law is true.
23. Show that in a complemented and distributive lattice a b a = 0 a’ b = 1
b’ a’.
24. Let (L, ) be a lattice. If we define a b = glb(a, b) and a b = lub(a, b) for a, b L, then show that both and
satisfy commutative, associative, absorption and idempotent laws.
25. Show that Demorgan’s law are true in a complemented and distributive lattice.
26. Show that every chain is a lattice.