Engineering Mathematics Material 2012

SUBJECT NAME : Discrete Mathematics

SUBJECT CODE : MA 2265
MATERIAL NAME : Problem Material
MATERIAL CODE : JM08ADM010

Name of the Student: Branch:

Unit – I (Logic and Proofs)

 Definitions
1) What are the possible truth values for an atomic statement?
2) Define a conditional statement and draw the truth table for it.
3) Express the statement, “The crop will be destroyed if there is a flood” in symbolic form.
4) Using truth table, show that  P  Q    P  Q .
5) Show that  P  Q    P  Q  is a tautology without using the truth table.
6) Define Bound and Free variables and give example.
7) State any two rules of inference with explanation.
8) Give the converse and the contrapositive of the implication “If it is raining, then I get
wet”.
9) Express the statement, “Some people who trust others are rewarded” in symbolic form.
10) What is meant by “proof by contradiction”?
 Predicate Calculus
1) Using truth table, show that P   Q  R  P   Q  R   P  Q   R .
2) Without using truth tables, show that Q   P  Q    P  Q  is tautology.
3) Without constructing the truth table show that
 P  Q     P   Q  R    P  Q    P  R  is a tautology.
4) Without using truth tables, show that  P   Q  R     Q  R    P  R   R .
5) Show the implication without constructing the truth table,
 Q   P  P     R   P  P     R  Q  .
 Inference Theory
1) Show that S is a valid inference from the premises
P  Q, Q  R, S  P and R .
2) Show that R  S is a valid conclusion from the premises
C  D,  C  D  H , H   A B  and  A B    R  S  .

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 1

Engineering Mathematics Material 2012

3) Prove that the following premises are inconsistent P  Q, Q  S , R  S

and P  R .
4) Show that the following premises are inconsistent:
(i) If Jack misses many classes due to illness, then he fails in high school.
(ii) If Jack fails in high school, then he is uneducated.
(iii) If Jack reads a lot of books, then he is not uneducated.
(iv) Jack misses many classes due to illness and reads a lot of books.

Hint: The given set of premises P1 , P2 , ... Pn are said to be consistent if and only if
P1  P2  ...  Pn  T and the premises are said to be inconsistent if and only if
P1  P2  ...  Pn  F .
5) Show that the following statement constitute a valid argument, by using method
of derivation.
If ‘A’ works hard, then either ‘B’ or ‘C’ will enjoy themselves.
If ‘B’ enjoys himself, then ‘A’ will not work hard.
If ‘D’ enjoys himself, then ‘C; will not.
Therefore, If ‘A’ works hard. ‘D’ will not enjoy himself.

6) Symbolize the following statements and then use the method of derivation. If
there are meeting, then travelling was difficult. If they arrived on time, then
travelling was not difficult. They arrived on time. Therefore, there was no
meeting. Show that these statements constitute a valid argument.

7) Show that the following premises are inconsistent.

(i) If Vijay misses many classes, then he fails in M.E.
(ii) If Vijay fails in M.E., then he is unemployed.
(iii) If Vijay appears for lot of interviews, then he is not unemployed.
(iv) Vijay misses many classes and appears for lot of interviews.

8) Verify the validity of the inference. If one person is more successful than the
other, then he has worked harder to deserve success. John has not worked
harder than Peter. Therefore, John is not more successful than Peter.

 Quantifiers
1) Show that  x  P( x)  Q( x)   x  Q( x)  R( x)   x  P( x)  R( x)  .
2) Is the following conclusion validly derivable from the premises given? If
 x  P( x)  Q( x) ,   y  P( y) then   z  Q( z ) .
3) Show that  x  P( x)  Q( x)   x  P( x )    x  Q( x ) by indirect method of proof.

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 2

Engineering Mathematics Material 2012

Unit – II (Combinatorics)
 Definitions
1) State the principle of mathematical induction and strong induction.
2) Prove by induction that n  2n .
3) State and prove the pigeonhole principle.
4) State extended pigeonhole principle.
5) Define recurrence relation.
6) Write the generating function for the sequence 1, a , a 2 , a 3 , a 4 , ...... .
7) Find the recurrence relation satisfying the equation yn  A(3)n  B( 4)n .

 Small Problems
1) If 13 people are assembled in a room, show that atleast 2 of them must have their
birthday in the same day.
2) Show that if 30 dictionaries in a library contain a total of 61327 pages, then one of the
dictionaries must have atleast 2045 pages.
3) Show that C (n, r )  C (n  1, r  1)  C (n  1, r ) .

 Mathematical Induction and Strong Induction

n( n  1)
1) Use mathematical induction to prove that 1  2  3  ...  n  .
2
n( n  1)(2n  1)
2) Use mathematical induction to prove that 12  22  32  ...  n2  .
6
 n( n  1) 
2

3) Using mathematical induction, prove that 1  2  3  ...  n  

3 3 3 3
 .
 2 
4) Using mathematical induction, prove that
n(2n  1)(2n  1)
12  32  52  ...  (2n  1)2  .
3
1 1 1 1 n
5) Prove by mathematical induction, that    ...   .
1.2 2.3 3.4 n( n  1) n  1
6) Prove that a n  b n is a multiple of a  b by using method of induction.
7) Prove that 8n  3n is a multiple of 5 by using method of induction.
8) Using mathematical induction, prove that 3n 2  42 n1 is divisible by 13, for all non
negative integers n .
9) Use mathematical inductions to show that n3  2n is a multiple of 3, for n  1 .
 
10) Use mathematical induction to prove that 3n  7n  2 is divisible by 8, for all n  1 .
11) State the principle of strong induction and prove that for any positive integer
n  2 is either a prime or a product of primes.

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 3

Engineering Mathematics Material 2012

 Recurrence relations
1) Solve the recurrence relation un 3  6un 2  11un1  6un  0 , with
u0  2, u1  0, u2  2 .
2) Solve the recurrence relation an  2  an1  an2  , for n  2 with a0  1, a1  2 .
3) Solve the recurrence relation an 2  an  0 , where n  0 and a0  1, a1  3 .
4) Using generating function, solve the recurrence relation an 2  8an1  15an  0 given
that a0  2, a1  8 .
5) Use the method of generating function to solve the recurrence relation:
S ( n  1)  8 S ( n)  16 S ( n  1)  4n , n  1 , with S (0)  1 and S (1)  8 .
6) Solve S (n)  2 S (n  1)  3 S (n  2)  0, n  2 with S (0)  3 and S (1)  1 by using
generating function.
7) Solve Y (n)  7Y (n  1)  10Y (n  2)  6  8n with Y (0)  1 , Y (1)  2 .
8) Solve the recurrence relation an  6an 1  8an  2  3n for n  2 , where a0  3, a1  7 .
9) Solve, by using generating function, the recurrence relation yn  1  2 yn  4 n with
y0  1 for n  0 .
10) Write the recurrence relation for Fibonacci number and hence solve it.
11) Find the generating function of Fibonacci sequence F (n)  F (n  1)  F (n  2) for
n  2 with for F (0)  F (1)  1 .
 Inclusion and Exclusion
1) Determine the number of integers between 1 and 250 that are divisible by any of the
integers 2,3,5 and 7 by principle of inclusion – exclusion.
Hint: Let A,B,C and D be the set of integers that are divisible by 2,3,5 and 7 respectively.
We have to find A  B  C  D .
2) Determine the number of positive integers “ n ” where 1  n  100 and n is not divisible
by 2,3,5.
Hint: Let A,B and C be the set of integers that are divisible by 2,3 and 5 respectively. First
we have to calculate A  B  C and then find 100  A  B  C .
3) Determine the number of positive integers “ n ” where 1  n  2000 and n is not
divisible by 2,3,5 but divisible by 7.
Hint: Let A,B,C and D be the set of integers that are divisible by 2,3,5 and 7 respectively.
We have to find A  B  C  D . Using the formula

 
A B C  D  A B C  D  D  A B C  
 D  D   A  B  C  and apply Distributive property.
4) Among the 1000 +ve integers, determine the integers that are divisible by 5 but not by 7
and 9.

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 4

Engineering Mathematics Material 2012

Hint: Let A,B and C be the set of integers that are divisible by 5,7 and 9 respectively. We
have to find A  B  C .
5) By using the principle of inclusion and exclusion, find the number of primes between 41
and 100?
Hint: Let A,B,C and D be the set of integers between 41 and 100 that are divisible by
2,3,5 and 7 respectively. We have to find A  B  C  D .
6) Use the principle of inclusion and exclusion to find the number of integer solutions of
the system x1  x2  x3  x4  20 , 1  x1  7, 1  x2  6, 5  x3  8, 2  x4  9 .
7) Among 100 students, 32 study mathematics, 20 study physics, 45 study biology, 15
study mathematics and biology, 7 study mathematics and physics, 10 study physics and
biology and 30 do not study any of the three subjects. Find the number of students
studying exactly one of the three subjects.
8) In a survey about liking colours, it was found that everyone who was surveyed had a
liking for at least one of the three colours namely R, G and B. Further 30% liked Red,
40% Green and 50% Blue. Further 10% liked R &G, 5% liked G & B, 10% liked R & B. Find
the percentage of surveyed people who liked all the three colours.
 Permutations and Combinations
1) How many different rearrangements are there of the word “REARRANGEMENT”?
2) How many solutions are there for the equation x  y  z  15 , where x , y , z  0 .
3) How many integer solutions are there x  y  z  20 , subjects to the constraints
x  1, y  0, z  4 .
Hint: The number of integer solutions of the equation x  y  z  d , where
x , y , z  0 , is C (d  no. of unknowns  1, d )  C (d  3  1, d ) .(This is nCr formula)

Unit – III (Graph Theory)

 Definitions
1) Define (a) Graph (b) Simple graph (c) Regular graph.
2) Define a complete graph and give and example.
3) Define a pendent vertex and pendent edge.
4) Define matrix representation of a graph.
5) Define bipartite graph.
6) Define isomorphism of a graph.
7) Define complementary and self complementary graph.
8) Define connected graph and give an example for connected and disconnected graphs.
9) Find the number of connected simple graph with four vertices.
10) How many edges are there in a graph with 10 vertices each of degree 5?
11) Define vertex connectivity.
12) Define edge connectivity.
13) Define Eulerian graph.

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 5

Engineering Mathematics Material 2012

14) Define Hamiltonian graph.

15) Define a Hamiltonian path of G.
 Incidence and Adjacency matrix (Refer class note)
 Isomorphic verifications (Refer class note)
 Theorems
1) Discuss the Konigsberg bridge problem.
2) Prove that in any graph G, the number of vertices of odd degree is even.
3) Prove that any self complementary graphs have 4n or 4n+1 vertices.
4) (Whitney’s inequality )For any graph G, show that
vertex connectivity  edge connectivity  minimum vertex degree and
give example for above.
k
5) If G is k – edge connected graph then prove that  .
2
6) Prove that a connected graph G is Eulerian if and only if all the vertices of G are of even
degree.
7) Prove that if a graph G has atmost two vertices of odd degree, then there can be Euler
path in G.
8) If G is a connected graph with n vertices n  3 and if the degree of each vertex is
atleast n / 2 , then show that G is Hamiltonian.

Unit – IV (Algebraic Structures)

 Definitions
1) Define sub semi groups with example.
2) Give an example of semi – group but not a monoid.
3) Define semi group homomorphism.
4) Define coset and give example.
5) Define normal subgroup of a group.
6) Define kernel of a homomorphism.
7) Define ring and give example. (or) Define when an algebraic system S ,  , . is called a
ring.
8) Define Integral domain with example.
9) Give an example of a commutative ring without identity.
10) Define field with example.
11) Give an examples of a ring which is not a field.

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 6

Engineering Mathematics Material 2012

 Small Problems
1) Let E  2,4,6,8 . Show that  E,   and  E ,  are semi – groups but not monoids.
2) Prove that the identity element of a group G is unique.
3) Prove that the inverse element of a group G is unique.
4) State and prove the cancellation law in a group.

 
1
5) If a  G , G be a group , then prove that a 1 a.

6) In a group G,  a * b 
1
 b1 * a 1 a, b  G .
7) Find the multiplication inverse of each element in Z11 .
8) If every element in a group is its own inverse then the group must be abelian.
9) For any a  G , a 2  e then prove that G is an abelian .
10) Prove that a group can not have any element which is idempotent except the identity
element.
11) Prove that a group G is abelian if and only if  a * b   a 2 * b2 a , b  G .
2

   
12) Find all cosets of a sub groups H  1, a 2 of a group G  1, a , a 2 , a 3 under usual

multiplication, where a 4  1 .
13) Let G  1, 1, i , i be a group and H  1, 1 be a sub group of G. What is the
number of distinct cosets of H in G.
14) Prove that a subgroup of an abelian group is a normal subgroup.
 Theorems
1) Prove that if G is an abelian group then for all a, b  G and all integer n,

 a * b
n
 bn * a n .
2) If S = N X N the set of ordered pairs of positive integers with the operation * defined by
 a, b *  c, d    ad  bc, bd  and if f :  S,*   Q,   is defined by
f  a, b    a / b , then show that f is a semi – group homomorphism.
3) If S is the set of all ordered pairs  a, b  of real numbers wit the binary operation 
defined by  a, b    c, d    a  c, b  d  , where a, b, c, d are real, prove that

 S ,   is a commutative group.
4) Show that the set of all positive rational numbers forms an abelian group under the
ab
composition defined by a * b  .
2
5) On the set Q of all rational numbers, the operation * is defined by a * b  a  b  ab .
Show that, under the operation *, Q is a commutative monoid.

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 7

Engineering Mathematics Material 2012

6) Prove the necessary and sufficient condition for a non – empty sub set to be a sub group
of a group.
(Or)
Prove that a non – empty subset H of a group (G,*) is a subgroup if and only if any
a , b  H implies a * b1  H .
7) Prove that the intersection of two normal subgroups of a groups G is also a normal
subgroup of G.
8) State and prove Lagrange’s theorem.
(or) Prove that the order of a subgroup of a finite group divides the order of the group.
9) Prove that the order of any element of a finite group is a divisor of the order of the
group (ie) O(a ) is a divisor of O(G ) for all a  G .
10) If G is a finite group, then prove that a O (G )  e for any element a  G .
11) Prove that a subgroup H of a group G under the operation * is a normal subgroup if and
only if a 1 * h * a  H for every a  G and h  H .
12) Prove that a subgroup H of a group G is normal if and only if xHx 1  H for all x  G .
(or) Prove that A subgroup H of G is normal if and only if left coset of H in G is equal to
the right coset of H in G.
13) If N and M are normal subgroup of G, prove that NM is also a normal subgroup of G.
14) Let  G,* and  G,   be groups and f is homomorphism from G to G , then prove
that the kernel of f is a normal subgroup.
15) If f is a homomorphism of G onto G with kernel K , then G / K is isomorphic to
G .
16) Prove that every finite group of order “n” is isomorphic to a permutation group of
degree n. (Cayley’s theorem on permutation group)

Unit – V (Lattices and Boolean algebra)

 Definitions
1) Define a poset and give an example. (or) Define partially ordered set.
2) Define a distribution lattice.
3) Give an example of a lattice which is modular but not distributive.
4) State any two properties of Lattices.
5) Define Boolean Algebra.
6) In a Boolean Algebra, prove that the complement of any element is unique.
7) Show that in any Boolean algebra, (a  b)(a  c )  ac  ab  bc .
8) Show that absorption laws are valid in a Boolean algebra.
9) Give an example of two – element Boolean Algebra.
 Lattices

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 8

Engineering Mathematics Material 2012

1) Let N be the set of all natural numbers with the relation R as follows: x R y if and only
if x divides y . Show that R is a partial order relation on N.
2) Let N be set of all natural numbers and define m  n if n  m is a non – negatie
integer. Show that  N ,   is a poset.

3) In a Lattice  L,   , prove that X  Y  Z    X  Y    X  Z  .

4) If  L,   is a Lattice, then for any a, b, c  L prove that

a   b  c    a  b   a  c  .
5) Show that in a complemented distributive lattice, the De Morgan’s laws hold.
(or) If  L,  ,   be a complemented distributive lattice, then for any a , b  L , prove

(1) a  b  a  b (2) a  b  a  b .
6) Show that in a complemented, distributed lattice, a  b  a  b  0
a b1b  a .
7) If L,  be a lattice, prove the following equivalent a , b  L ,
a  b ab  a ab  b.
8) If a , b, c are element of a distributive lattice  L, ,   shown that a  b  a  c and
ab  ac b  c .
9) If L,  is a ordered lattice, show that  L, ,   is an algebraic lattice.
10) Show that every chain is a distributive lattices.
11) Show that if L is a distributive lattice than for all a, b, c  L ,
 a * b   b * c    c * a    a  b *  b  c  *  c  a  .
12) If L is a distributive lattice with 0 and 1, show that each element has at most one
complement.
13) Show that every distributive lattice is modular. Is the converse true? Justify the claim.
 Boolean Algebra
1) Show that in any Boolean algebra  a  b  a  c   ac  ab  bc .
2) Show that in any Boolean algebra, a  b if and only if ab  ab  0 .

3) In a Boolean algebra B prove that  a  b   a   b and  a  b   a   b for

all a, b  B . (DeMorgon’s Law )
4) In any Boolean algebra, show that  a  b  b  c  c  a    a  b  b  c  c  a  .
5) Prove that in any Boolean algebra ab  bc  ca  ab  bc  ca .
6) If x, y are elements in a Boolean algebra, then prove that x  y  x  y .
7) If B is a Boolean algebra, then for a  B a  1  1, a.0  0 .

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 9

Engineering Mathematics Material 2012

---- All the Best ----

Prepared by C.Ganesan, M.Sc., M.Phil., (Ph:9841168917) Page 10