Dayalbagh Educational Institute

Department of Mathematics
MAM 102, Discrete Mathematics
Question Bank (2017-18) REVISED: July 2017

UNIT 1

1. Construct a truth table for each of these compound propositions.

a) p→￢q b) ￢p ↔q c) (p →q) ∨(￢p →q) d) (p →q) ∧(￢p →q)
e) (p↔q) ∨(￢p ↔q) f ) (￢p ↔￢q) ↔(p ↔q)

2. Explain, without using a truth table, why (p ∨q ∨r) ∧(￢p ∨￢q ∨￢r) is true when at
least one of p, q, and r is true and at least one is false, but is false when all three variables
have the same truth value.

3. Show that each of these conditional statements is a tautology by using truth tables.
a) [￢p ∧(p ∨q)] →q b) [(p →q) ∧(q →r)] →(p →r)
c) [p∧(p →q)] →q d) [(p ∨q) ∧(p →r) ∧(q →r)] →r

4. Show that the following are logically equivalent without constructing a truth table
a) (p→q) ∨(p →r) and p →(q ∨r) b) (p →r) ∨(q →r) and (p ∧q) →r
c) ￢p →(q →r) and q →(p ∨r) d) ((q ∧ r) → s) ∧ (r → (p ∨ s)) and (r ∧ (p → q)) → s

5. Find formulas in CNF and DNF equivalent to each of the following formulas:
(a) ￢(p ∧T)
(b) ((p→q) →r) → F
(c) ￢ (p ↔q) ↔ r
(d) ((p∨ q) →r) ∧(r →￢(p ∨ q))
(e) (￢r) →(((p ∨ q) --+ r) →￢q)

6. Translate each of these statements into logical expressions using predicates, quantifiers,
and logical connectives.
a) Something is not in the correct place.
b) All tools are in the correct place and are in excellent condition.
c) Everything is in the correct place and in excellent condition.
d) Nothing is in the correct place and is in excellent condition.
e) One of your tools is not in the correct place, but it is in excellent condition.

7. Translate these specifications into English where F(p) is “Printer p is out of service,” B(p)
is “Printer p is busy,” L(j) is “Print job j is lost,” and Q(j) is “Print job j is queued.”
a) ∃p(F(p) ∧B(p)) →∃jL(j)
b) ∀pB(p) →∃jQ(j)
c) ∃j (Q(j) ∧L(j)) →∃pF(p)
d) (∀pB(p) ∧∀jQ(j)) →∃jL(j)

8. Translate these statements into English, where the domain for each variable consists of all
real numbers.
a) ∃x∀y(xy= y)
b) ∀x∀y(((x ≥0) ∧(y <0)) →(x −y >0))
c) ∀x∀y∃z(x = y + z)

9. Rewrite each of these statements so that negations appear only within predicates (that is,
so that no negation is outside a quantifier or an expression involving logical connectives).
a) ￢∃y∃xP(x, y) b) ￢∀x∃yP(x, y)
c) ￢∃y(Q(y) ∧∀x￢R(x, y))
d) ￢∃y(∃xR(x, y) ∨∀xS(x, y))
e) ￢∃y(∀x∃zT (x, y, z) ∨∃x∀zU(x, y, z))

10. List rules of inference of propositional logic and of quantified statements

11. What rule of inference is used in each of these arguments?

a) Kangaroos live in Australia and are marsupials. Therefore, kangaroos are marsupials.
b) It is either hotter than 100 degrees today or the pollution is dangerous. It is less than
100 degrees outside today. Therefore, the pollution is dangerous.
c) Linda is an excellent swimmer. If Linda is an excellent swimmer, then she can work as
a lifeguard. Therefore, Linda can work as a lifeguard.

12. Show that the argument form with premises (p ∧t) →(r ∨s), q →(u ∧t), u →p, and ￢s
and conclusion q →r is valid.
Use rules of inference to show that if ∀x(P(x) →(Q(x) ∧S(x))) and ∀x(P(x) ∧R(x)) are
true, then ∀(R(x) ∧S(x)) is true.
13. Given the following statements as premises, all referring to an arbitrary meal:
(a) If he takes coffee, he does not drink milk.
(b) If he eats crackers only then he drinks milk.
(c) He does not take soup unless he eats crackers.
(d) At noon today, he had coffee.
Whether he took soup at noon today?
 14. Show that the following argument is a correct argument:
P
p q r s
q
￢s
r

15. Validate the statements:

If horses fly or cows eat grass, then the mosquito is the national bird. If the mosquito is
the national bird, then peanut butter tastes good on burgers. But, peanut butter tastes
terrible on burgers. Therefore, the cows do not eat grass.

16. Validate the statements:

If today is Tuesday, then I have a test in mathematics or a test in statistics. If my statistics
teacher is sick, then I will not have a test in statistics. Today is Tuesday and my statistics
professor is sick. Therefore, I have a test in mathematics.

17. Validate the statements:

Babies are illogical. Illogical people are despised. Nobody who can manage a crocodile is
despised. Therefore, babies cannot manage crocodiles.

18. Validate the statements:

Each living thing is a plant or animal. David’s dog is alive and it is not a plant. All
animals have heart. Hence, David’s dog has a heart.

19. Prove that is not a rational number using variables and quantifiers.

20. Prove that using predicate variables and quantifiers.

UNIT 2

1. Prove De Morgan’s law for set union and intersection.

2. Let A be a set of universe U. Prove that complement of A is unique.
3. Prove that set of integers is countable.
4. Prove that the set of Rational numbers is uncountable.
5. Prove that the set [0,1] is uncountable. Hence prove that set of real numbers is uncountable.
6. Define upper bound, lower bound, supremum and infimum with examples.
7. Let A, B be sets with | | . If there are 4096 relations from A to B, then what is | | ?
8. Let A= {1, 2, 3, 4} and B ={x, y, z}
i. Ho w many functions are there?
ii. How many functions are one-to-one?
iii. How many functions are there?
iv. How many functions are one-to-one?
9. Let R= {(x,y)|x, y x-y is divisible by 3}. Show that R is an equivalence
relation..Find a partition of .
10. Let R={(x,y)|x, y x-y is divisible by n}. Show that R is an equivalence relation..Find
a partition of .
11. Let R denote a relation on the set of ordered pairs of positive integers such that (x,y)R(u,v)iff
xv=yu. Show that R is an equivalence relation.
12. Let R={(1,2),(3,4),(2,2)} and S={(4,2),(2,5),(3,1),(1,3)}. Find RoS,SoR, Ro(SoR), (RoS)oR,
RoR, SoS and RoRoR.
13. Let X={1,2,3}, Y={p,q} and Z={a,b}. Also let be f = { (1,p), (2,p), (3,q)} and
be given by g = { (p,b), (q,b)}. Find gof.
14. Let be given by and be given by , where is
the set of real numbers. Find fog. Is gof defined?
15. Show that the functions and g for are inverse of each other.

UNIT 3

1. What is principle of Mathematical Induction?

a) Prove that the sum of first n odd positive integers is n2.
b) Prove that for all n 1, n3+2n is a multiple of 3.
2. Use mathematical induction to prove that 1+2+22+…+2n= 2n+1 - 1 for all non-negative
integers.
3. Use mathematical induction to prove that 2n> n3 for all non-negative integers greater than 10.
4. Use mathematical induction to prove that for n>1.
5. Use mathematical induction to prove that for all natural
numbers n.
6. What is the principle of strong Mathematical Induction? Show that if n is an integer greater
than 1, then n can be written as product of primes.
7. Define gcd. Find gcd of 427 and 616 and express it in the form of 427x+616y.
8. Prove that there exist an infinite number of primes.
9. State and prove division algorithm.
10. For any positive integer n, prove that 8n+3 and 5n +2 are relatively prime.
11. What is a congruence relation? State and prove its properties.
12. Prove that two integers a and b are congruent modulo m if and only if these have the same
remainder when divided by m.
13. If a b(mod m) and c is an integer, then
a) a+c b+c(mod m)
b) a+mc b(mod m)
c) a-c b-d(mod m)
d) ac bc(mod m)

14. If a, b, c and d are integers such that a b(mod m) and c d(mod m), then prove that
e) a+c b+d(mod m)
f) a-c b-d(mod m)
g) ac bd(mod m)
h) ak=bk(mod m)

UNIT 4

1. If 56Pr+6 : 54Pr+3= 30,800 : 1, find the value of r.

2. Find out how many 5-digits numbers greater than 30,000 can be formed from the digits 1, 2,
3, 4, 5.
3. The CEO of 18 software companies meet. In how many ways can they sit themselves around
a table so that CEO of TATA, HCL and Infosys choose to sit together?
4. How many different numbers can be formed from the digits 0, 2, 3, 4, 5, 6 lying between 100
and 1000 and how many of these are divisible by 5?
5. If nCx = 56 and nPx = 336, find n and x.
6. Out of 4 officer and 10 clerks in an organization, a committee of five consisting of 2 officers
and 3 clerks is to be formed. In how many ways can this be done if
i. Any officer and any clerk can be included.
ii. One particular clerk must be included in the committee.
iii. One particular officer cannot be included in the committee.
7. For an examination, a candidate has to select 7 subjects from 3 different sections A, B, and
C. The three sections contain 4, 5 and 6 subjects respectively. In how many ways can a
candidate make his selection if he has to select at least 2 subjects from each section?
8. An examination paper consists of 12 questions is divided into two parts: A and B. Part A
contains 7 questions and part B contains 5 questions. A candidate is required to answer 8
questions electing at least 3 questions from each part. In how many ways can the candidate
select the questions?
9. How many triangles can be made by joining three points out of 12 points in a plane, given
that 7 are in one line?
10. A job placement agency in Mumbai has to send ten students to five companies, two to each.
Two of the companies are in Mumbai and others are outside. Two of the students prefer to
 work in Mumbai while three prefer to work outside. In how many ways assignment can be
made if preferences are to be satisfied.
11. Determine the coefficient of x9y3 in (x+y) 12 and xyz2 in (x+y+z)4.
12. Find the number of non-negative integer solutions to the equation: x1+ x2+ x3+ x4 = 13 with the
extra condition that xi ≤5, for all 1≤i ≤4.
13. Suppose 4 letters are placed in addressed envelope. Find the number of ways such that no
letter is placed in the right envelope.
14. a. What is the coefficient of x7 in (1 + x)11?
b. What is the coefficient of x9 in (2 − x)19?
c. What is the coefficient of x8y9 in the expansion of (3x + 2y) 17?

15. Show that ( )≤2n for all positive integers n and all integers k with 0 ≤k ≤n.
16. What is pigeonhole principle? Prove that if 101 integers are selected from the set
A={1,2,…,200}, then there are two integers such that one divides the other.
17. Suppose a set of positive integers contain 37 elements. Then prove that the set contains two
elements that have the same remainder upon division by 36.

UNIT 5

1. Find the generating function for each of the following sequences:

i. 1, -1, 1, -1, 1, -1, …
ii. 1, 0, 1, 0, 1, 0, …
iii. 0, 6, -6, 6, -6, 6,…
iv. ( ) ( ) ( ) ( )
2. Determine the sequence generated by each of the following generating functions:
i.

ii.
iii.
3. Establish recurrence relation for the Fibonacci sequence and find its solution. Also find the
golden ratio.
4. Solve the following recurrence relations by substitution method:
i.
ii.
5. Solve the following recurrence relations using generating functions:
i.
ii.
iii.
6. Solve the following recurrence relations by characteristic root method:
i.
ii.
iii.

7. Find particular solutions of the following recurrence relations:

i.
ii.
iii.
iv.
v.

8. Determine the number of subsets of a set of n elements, n>=0.

9. Define convolution of numeric functions.

Given { and { , find Convolution of and .

10. i) Find the generating function of the geometric progression {arn}n>=0.

ii) Find the generating function of finite geometric progression.

11. Find solution of the following recurrence relations by the method of generating functions:
i.
ii.
iii.