K.L.N.

COLLEGE OF ENGINEERING
(An Autonomous Institution, Affiliated to Anna University, Chennai)
DEPARTMENT OF MATHEMATICS
20BS303 – Discrete Mathematics
Unit – I Logic and Proofs
Part-A Questions

1. Express the statement “Good food is not cheap” in symbolic form.

P: Food is Good
Q: Food is Cheap
Therefore the symbolic form is P → ~𝑸
2. Write an equivalent formula for 𝑷 Ʌ (Q↔ R) which contains neither the biconditional nor
theconditional.
𝑷 (𝑸 → 𝑹) (𝑹 → 𝑸)]

3. Express the statement “ The crop will be destroyed if there is a flood” in symbolic form.
P: The crop will be destroyed
Q: There is a flood
The given statement is Q → 𝑷
4. Prove that (P→ (P∨𝑸)) is a tautology.
<=> ~P∨ (𝑷 ∨𝑸)
<=> (~P∨ 𝑷 )∨𝑸
<=> (𝑷 ∨~𝑷) ∨ Q
<=> T ∨ 𝑸
<=>T
5. Define Min terms and Max terms.
Min terms: Let P and Q be two statement variables. The Formulae P Ʌ 𝑸, P Ʌ ∽𝑸,
∽𝑷 Ʌ 𝑸, ∼𝑷 Ʌ ∽𝑸are called Min terms.
Max terms: Let P and Q be two statement variables. The Formulae P∨𝑸,
𝑷∨∽𝑸, ∽𝑷∨𝑸, ∼𝑷∨∽𝑸 are called Max terms.

6. Give the converse and contra positive of the implication” If it is raining, then I get wet”.
P: It is raining Q: I get Wet.
Q → 𝑷: (Converse)If I get wet, then it is raining.
∽ Q →∼𝑷 : (Contra positive) If I do not get wet, then it is not raining.

7. Express the statement “ For every ‘x’ there exists a ‘y’ such that 𝒙𝟐+ 𝒚𝟐≥ 𝟏𝟎𝟎
insymbolic form.
(∀𝒙)(∃𝒚)(𝒙𝟐+ 𝒚𝟐≥ 𝟏𝟎𝟎)
8. Express the statement, “ Some people who trust others are rewarded” in
symbolicform.
Let 𝒙 is a person: P(𝒙)
𝒙 trusts others: T(𝒙)
𝒙 is rewarded: R(𝒙)
Symbolic form: (∃𝒙)[𝑷(𝒙) Ʌ 𝑻(𝒙) Ʌ 𝑹(𝒙)]

9. Give Symbolic form of the statement “ All men are giants”.

M(x) : 𝒙 is a man and G(x) : 𝒙 is a giant
Symbolic form: (∀𝒙)[𝑴(𝒙) → 𝑮(𝒙)]
10. How can this English sentence be translated into a logical expression?
“You can access the internet from campus only if you are a computer science student or you
are not a freshman.”
Let A : You can access the internet from campus
B: you are a computer science student
C: you are a freshman. The logical expression: 𝑨 → (𝑩∨∼𝑪)

11. Translate the statement “ The sum of the two positive integer is always positive.”
(∀𝒙)(∀𝒚)(𝒙 + 𝒚> 0)

12. Express the statement “Some student in this class has visited Mexico” using predicates and
quantifiers.
x is a student in this class: C(x)
x has visited Mexico: M(x)
Symbolic form: (∃𝒙)[𝑪(𝒙) ⋀𝑴(𝒙)]

13. Define free and bound variable.

Free variable : Any occurrence of the variable x that is not bound by a quantifier or set
equal to a particular value is called a free variable.
Bound variable: When a quantifier is used on the variable x, we say that this occurrence of the
variable is bound.

14. State the rules of inference for statement calculus.

Rule P: A premise may be introduced at any point in the derivation.
Rule T: A formula S may be introduced in a derivation if S is a tautologically implied by one or
moreof the preceding formulas in the derivation.
Rule CP: If we can derive S from R and a set of premises, then we can derive 𝑹 → 𝑺 from the set
of premises alone.

15. Write the negation and symbolize “ Every student in the class studied Discrete Mathematics”.
Let x is a student: S(x)
x studied Discrete Mathematics: D(x)
Symbolic form: :(∀𝒙)(𝑺(𝒙) → 𝑫(𝒙))
Negation: There are some students in the class who did not study Discrete Mathematics
~[(∀𝒙){𝑺(𝒙) → 𝑫(𝒙)}] ⟺ ~[(∀𝒙){~𝑺(𝒙) ∨𝑫(𝒙)}] ⟺ (∃𝒙)[𝑺(𝒙) Ʌ ∼𝑫(𝒙)]

16. Obtain DNF and CNF of P Ʌ (P⟶𝑸)

DNF:
P Ʌ (P⟶𝑸) ⟺ P Ʌ (∼𝑷∨𝑸) ⟺ (P Ʌ ∼𝑷) ∨ (P Ʌ Q)
CNF:
P Ʌ (P⟶𝑸) ⟺ P Ʌ (∼𝑷∨𝑸)
-------------------------------------------------------------------------------------------------------------------
17. Express the bi-conditional 𝑷 ↔ 𝑸 in any form using only disjunction(Ʌ) ,
conjunction(∨)andnegation (∼).
𝑷 ↔ 𝑸⟺ (𝑷⟶𝑸) Ʌ (𝑸⟶𝑷) ⟺ (∼𝑷∨𝑸) Ʌ (∼𝑸∨𝑷)
 K.L.N. COLLEGE OF ENGINEERING,POTTAPALAYAM
DEPARTMENT OF MATHEMATICS
20BS303 – Discrete Mathematics
Unit – I Logic and Proofs
Part-B Questions
1. Show that (∼ 𝐏 ∧ (∼ 𝐐 ∧ 𝐑)) ∨ (𝐐 ∧ 𝐑) ∨ (𝐏 ∧ 𝐑) ⇔ 𝐑 without using truth table.
2. Show that 𝐏 → (𝐐 ∨ 𝐑) ⇔∼ 𝐑 → (𝐏 → 𝐐) ⇔ (𝐏 ∧∼ 𝐐) → 𝐑.
3. Show that 𝐏 → (𝐐 → 𝐑) ⇔ 𝐏 → (∼ 𝐐 ∨ 𝐑) ⇔ (𝐏 ∧ 𝐐) → 𝐑.
4. Show that (𝐏 ∧ (𝐏 → 𝐐)) ⇒ 𝐐 is a tautology using logic simplification.
5. Prove that the conditional statement ((𝐏 → 𝐐) ∧ (𝐐 → 𝐑)) ⇒ (𝐏 → 𝐑) is a tautology without using
truth table.
6. Using truth table obtain the PDNF of (𝐏 ∧ 𝐐) ∨ (∼ 𝐏 ∧ 𝐑) ∨ (𝐐 ∧ 𝐑) and hence find PCNF.
7. Determine the PCNF and PDNF of 𝑺: (∼ 𝐏 → 𝐑) ∧ (𝐐 ↔ 𝐏) using logical equivalences.

8. Compute the PDNF and PCNF of the formula 𝑷 ∨ (∼ 𝑷 → (𝑸 ∨ (∼ 𝑸 → 𝑹)))

9. Obtain the principal conjunctive normal form and principal disjunctive normal form of

(𝐏 ∨ 𝐑) ∧ (𝐐 → 𝐑) ∧ (𝐏 → 𝐐) using equivalences.
10. Show that 𝐑 ∧ (𝐏 ∨ 𝐐) is a valid conclusion from the premises 𝐏 ∨ 𝐐, 𝐐 → 𝐑, 𝐏 → 𝐌, and ∼ 𝐌.
11. Using rule CP show that 𝐑 → 𝐒 for the premises 𝐏 → (𝐐 → 𝐒), ∼ 𝐑 ∨ 𝐏, 𝐐.
12. Using rule CP show that 𝐏 → 𝐒 form the premises ∼ 𝐏 ∨ 𝐐, ∼ 𝐐 ∨ 𝐑, 𝐑 → 𝐒
13. Show that the hypothesis, it is not sunny this afternoon and it is colder than yesterday. We will go
swimming only if it is sunny this afternoon. If we do not go swimming then we will take a canoe trip.
If we take a canoe trip then we will be home by sunset. Leads to the conclusion “we will be home by
sunset”.
14. Show that the following set of premises are inconsistent 𝐀 → (𝐁 → 𝐂), 𝐃 → (𝐁 ∧∼ 𝐂), 𝐀 ∧ 𝐃.
15. Show that the following premises are inconsistent .
If Ram misses many classes through illness then he fails high school. If Ram fails high school then
he is uneducated. If Ram reads a lot of books then he is not uneducated. Ram misses many
classes through illness and he reads a lot of books.
16. Prove the following statement. If (𝒙)(𝑷(𝒙) → 𝑸(𝒙)), (∃𝒚)𝑷(𝒚) then (∃𝒛)𝑸(𝒛) by using indirect
method.
17. Show by indirect method of proof that (∀𝒙)(𝒑(𝒙) ∨ 𝐪(𝐱)) ⇒ (∀𝒙𝒑(𝒙)) ∨ (∃𝒙𝒒(𝒙))
18. Show that the following argument is valid “Every microcomputer has a serial surface part. Some
microcomputer have parallel part. Therefore some microcomputer have both serial and parallel
part”.
19. Verify the validity of the argument. “Every living thing is a plant or animal. Jhon’s Gold fish is alive
and it is not a plant. All animal have hearts”. Therefore John’s Gold fish has a heart”.
20. Prove that √𝟐 is irrational by the method of contradiction.
 K.L.N. COLLEGE OF ENGINEERING, POTTAPALAYAM-630 612.
(An Autonomous Institution affiliated to Anna University, Chennai)
DEPARTMENT OF MATHEMATICS
20BS303 – DISCRETE MATHEMATICS

UNIT 1- LOGIC AND PROOFS

TUTORIAL I

1. Show that (∼ Q ∧ (P → Q)) ⇒∼ P is a Tautology using logical equivalences.

2. Show that (∼ 𝐏 ∧ (∼ 𝐐 ∧ 𝐑)) ∨ (𝐐 ∧ 𝐑) ∨ (𝐏 ∧ 𝐑) ⇔ 𝐑 without using truth table.

3. Show that 𝐏 → (𝐐 → 𝐑) ⇔ 𝐏 → (∼ 𝐐 ∨ 𝐑) ⇔ (𝐏 ∧ 𝐐) → 𝐑.

4. Determine the PCNF and PDNF of 𝑺: (∼ 𝐏 → 𝐑) ∧ (𝐐 ↔ 𝐏) using logical equivalences

TUTORIAL II
1. Using truth table obtain the PDNF of (𝐏 ∧ 𝐐) ∨ (∼ 𝐏 ∧ 𝐑) ∨ (Q ∧ 𝐑)) and hence find
PCNF.

2. Obtain the PCNF and PDNF of (𝐏 ∨ 𝐑) ∧ (𝐐 → 𝐑) ∧ (𝐏 → 𝐐) using equivalences.

3. Show that 𝐑 ∧ (𝐏 ∨ 𝐐) is a valid conclusion from the premises 𝐏 ∨ 𝐐, 𝐐 → 𝐑, 𝐏 → 𝐌, and ∼

𝐌.
4. Using rule CP show that 𝐑 → 𝐒 for the premises 𝐏 → (𝐐 → 𝐒), ∼ 𝐑 ∨ 𝐏, 𝐐.
TUTORIAL III

1. Show that the following premises are inconsistent .

If Ram misses many classes through illness then he fails high school. If Ram fails high
school then he is uneducated. If Ram reads a lot of books then he is not uneducated. Ram
misses many classes through illness and he reads a lot of books.
2. Show that the hypothesis, it is not sunny this afternoon and it is colder than yesterday.
We will go swimming only if it is sunny this afternoon. If we do not go swimming then
we will take a canoe trip. If we take a canoe trip then we will be home by sunset. Leads
to the conclusion “we will be home by sunset”.
3. Show by indirect method of proof that (∀𝒙)(𝑷(𝒙) ∨ 𝐐(𝐱)) ⇔ ((∀𝒙)𝑷(𝒙)) ∨ (∃𝒙𝑸(𝒙)) .
4. Show that the following argument is valid “Every microcomputer has a serial surface
part. Some microcomputer have parallel part. Therefore some microcomputer have both
serial and parallel part”.
 K.L.N. COLLEGE OF ENGINEERING
(An Autonomous Institution, Affiliated to Anna University, Chennai)
DEPARTMENT OF MATHEMATICS
20BS303 – Discrete Mathematics
Assignment 1
D.O.A: D.O.S:
UNIT – I LOGIC AND PROOFS

1. Show that 𝑸 ∨ (𝑷 ∧∼ 𝐐) ∨ (∼ 𝐏 ∧∼ 𝐐) is a Tautology using truth table.

2. Show that (𝐏 ∨ 𝑸) ∧∼ (∼ 𝐏 ∧ 𝐐) ⇔ 𝐏 without using truth table.

3. Show that 𝑷 → (𝐐 ∨ 𝑹) ⇔ (𝐏 → 𝑸) ∨ (𝐏 → 𝑹) without using truth table.

4. Determine the PCNF and PDNF of 𝑺: ((∼ 𝐐 ∨∼ 𝐑) →∼ 𝐏) ∧ ((𝐐 ∧ 𝐑) → 𝑷) using logical

equivalences.

5. Show that the following premises are inconsistent .

If the contract is valid then John is liable for penalty. If John is liable for penalty then he will go

bankrupt. If the bank will loan him money, he will not go bankrupt. As a matter of fact, the contract is

valid and the bank will loan him money.

6. Show that the following arguments are valid. “ All integers are rational numbers. Some integers are

power of 3”. Therefore some rational numbers are power of 3.

7. Show that (∀𝒙)𝑷(𝒙) ∧ (∃𝒙)𝐐(𝐱) ⇔ (∀𝒙)(∃𝒙)[𝑷(𝒙) ∧ 𝑸(𝒙)]

 K.L.N. COLLEGE OF ENGINEERING,POTTAPALAYAM
(An Autonomous Institution, Affiliated to Anna University, Chennai)
DEPARTMENT OF MATHEMATICS
20BS303- Discrete Mathematics
Unit – II COMBINATORICS
Part-A Questions
1. How many different bit strings of length seven are there?
Each of seven bits can be chosen in two ways, because each bit is either 0 or 1. Therefore a total of 27=
128 different bit strings of length seven.
_____________________________________________________________________________________
2. State the generalized Pigeonhole principle.
𝑵−𝟏
If N objects are placed into K boxes, then there is at least one box containing at least [ 𝑲 ] + 𝟏 objects.
3. Show that in any group of 29 persons at least five persons must have born on the same day of
the week.
Seven days of the week as 7 pigeon holes and 29 persons as pigeons.
𝑵−𝟏
Using generalized Pigeon hole Principle [ 𝑲 ] + 𝟏 = 𝟓 .
Hence at least 5 of any 29 persons must have born on the same day of the week.
______________________________________________________________________________
4. State the Pigeonhole principle.
If n pigeons are accommodated in m pigeon holes and 𝒏 > 𝒎, then atleast 1 pigeon hole contains 2
or more pigeons.
_______________________________________________________________________________
5. Determine the number of three letter words using the given six letters without repeating any
letters in a given word.
𝟔𝑷𝟑 = 𝟔 ∗ 𝟓 ∗ 𝟒 = 𝟏𝟐𝟎.
______________________________________________________________________________________
6. Obtain the number of permutations of all the letters of the words in “ENGINEERING”.
Total number of letters: 11
No. of times each letter appears in the word “ENGINEERING” :
𝑬 ⟶ 𝟑 times, 𝑵 ⟶ 𝟑 times, 𝑰 ⟶ 𝟐 times & 𝑮 ⟶ 𝟐 times & R ⟶ 𝟏 time
𝟏𝟏!
Number of permutations =
𝟑!𝟑!𝟐!𝟐!𝟏!
______________________________________________________________________________________
7. In how many ways can letters of the word “INDIA” be arraged?
Total number of letters: 5
No. of times ‘I’ appears in the word “INDIA” : 𝑰 ⟶ 𝟐 times
𝟓!
= 60.
No. of possible ways =
𝟐!
__________________________________________________________________________
8. Determine the number of distinct permutations that can be formed from all the letters of the
word “RADAR”.
Total number of letters: 5
No. of times each letter appears in the word “RADAR” : R ⟶ 𝟐 times , A ⟶ 𝟐 times
𝟓!
No. of possible ways = = 30.
𝟐!𝟐!
__________________________________________________________________________________
9. In how many ways can 8 persons be seated at a round table if they can sit anywhere?
Circular permutation = (𝒏 − 𝟏)! = (𝟖 − 𝟏)! = 𝟕 ! = 𝟓𝟎𝟒𝟎 ways.
______________________________________________________________________________________
10. How many ways are there to select five players from a 10- member tennis team to make a trip to
a match at another college?
𝟏𝟎 !
𝟏𝟎𝑪𝟓 = = 𝟐𝟓𝟐
𝟓 !𝟓 !
____________________________________________________________________________________
 11. In how many ways can a selection of 3 books be made from 13 books so as to include always one
particular book?
First select one particular book, Remaining (13-1)= 12 books are available to select 2 books.
𝟏𝟐 !
𝟏𝟐𝑪𝟐 = = 𝟔𝟔
𝟐 !𝟏𝟎 !
______________________________________________________________________________________
12. In how many ways can a prize winner choose three CD’s from the top ten lists if repetition are
allowed?
n = 10 and r=3 using the formula (𝒏 + 𝒓 − 𝟏) = 𝟏𝟐𝑪𝟑 = 𝟐𝟐𝟎
______________________________________________________________________________________
13. How many possibilities are there for win , place and show (first, second and third) positions in a
horse race with 12 horses if all orders are possible?
The number of ways to pick the three winners in the number ordered selections of three elements
from 12.
𝟏𝟐𝑷𝟑 = 𝟏𝟐 ∗ 𝟏𝟏 ∗ 𝟏𝟎 = 𝟏𝟑𝟐𝟎.
______________________________________________________________________________________

14. How many different 2-digit numbers can be made from the digits 1,2,3,4,5,6,7,8,9,0?
when repetition is allowed? when repetition is not allowed?
Case 1: When repetition is allowed.
The tens place can be filled by 10 ways and the units place can be filled by 10 ways.
Therefore the total number of 2 digit numbers = 10 * 10 =100 Case 2: When repetition is
not allowed.
The tens place can be filled by 10 ways and the units place can be filled by9ways.
Therefore the total number of 2 digit numbers = 10 * 9 =90
______________________________________________________________________________________

15. Let {𝒂𝒏 } be a sequence that satisfies the recurrence relation 𝒂𝒏 = 𝒂𝒏−𝟏 − 𝒂𝒏−𝟐 for
𝒏 = 𝟏, 𝟐, 𝟑, 𝟒 … and suppose that 𝒂𝟎 = 𝟑 & 𝒂𝟏 = 𝟓 then find 𝒂𝟐 & 𝒂𝟑 .
𝒂𝟐 = 𝒂𝟏 − 𝒂𝟎 = 𝟓 − 𝟑 = 𝟐
𝒂𝟑 = 𝒂𝟐 − 𝒂𝟏 = 𝟐 − 𝟓 = −𝟑
______________________________________________________________________________________
16. Obtain the recurrence relation for the solution (𝒌) = 𝟓.𝟐𝒌
𝑫(𝒌) = 𝟓.𝟐𝒌 … (𝟏)
𝟓
𝑫(𝒌 − 𝟏) = 𝟓. 𝟐𝒌−𝟏 = 𝟐 . 𝟐𝒌
𝟐𝑫(𝒌 − 𝟏) = 𝟓.𝟐𝒌 … (𝟐)
(𝟏) − (𝟐) => (𝒌) − (𝒌 − 𝟏) = 𝟎 is the required relation.
_____________________________________________________________________________________
17. Find the recurrence relation satisfying 𝒚𝒏 = 𝑨𝟑𝒏 + 𝑩(−𝟒)𝒏
Let 𝒚𝒏 = 𝑨𝟑𝒏 + (−𝟒)… (1)
𝒚𝒏+𝟏 = 𝑨𝟑𝒏+𝟏 + 𝑩(−𝟒)𝒏+𝟏
𝒚𝒏+𝟏 = 𝟑𝑨𝟑𝒏 − (−𝟒) …(2)
𝒚𝒏+𝟐 = 𝟗𝑨𝟑𝒏 + (−𝟒)𝒏 …(3)
(𝟑) + (𝟐) − 𝟏𝟐(𝟏) = 𝒚𝒏+𝟐 + 𝒚𝒏+𝟏 − 𝟏𝟐𝒚𝒏 = 𝟎
______________________________________________________________________________________

18. What is the generating function for the sequence 1,1,1,1,1?

The generating function of 1,1,1,1,1 is 𝟏 + 𝒙 + 𝒙𝟐 + 𝒙𝟑 + 𝒙𝟒
𝒙𝟓 −𝟏
(i.e.,) 𝟏 + 𝒙 + 𝒙𝟐 + 𝒙𝟑 + 𝒙𝟒 = 𝒙−𝟏 when 𝒙 ≠ 𝟏
______________________________________________________________________________________
 K.L.N. COLLEGE OF ENGINEERING
(An Autonomous Institution, Affiliated to Anna University, Chennai)
DEPARTMENT OF MATHEMATICS
20BS303 – Discrete Mathematics
Unit – II COMBINATORICS
Part-B Questions
𝒏(𝒏+𝟏)
1. Using mathematical induction show that 𝟏 + 𝟐 + 𝟑 + ⋯ + 𝒏 = , 𝒏 ≥ 𝟏.
𝟐
𝒏(𝒏+𝟏)(𝟐𝒏+𝟏)
2. Using mathematical induction show that 𝟏𝟐 + 𝟐𝟐 + 𝟑𝟐 + ⋯ + 𝒏𝟐 = 𝟔
.
3. Show that 𝒏𝟑 + 𝟐𝒏 is divisible by 3 where 𝒏 ≥ 𝟏 by mathematical induction.
𝟏 𝟏 𝟏 𝟏
4. Show that + + + ⋯+ > √𝒏 for 𝒏 ≥ 𝟐 by mathematical induction.
√𝟏 √𝟐 √𝟑 √𝒏
𝟑𝒏+𝟏 −𝟏
5. Using mathematical induction show that ∑𝒏𝒓=𝟎 𝟑𝒓 = 𝟐
.
𝒏 𝒏
6. Snow that 𝒂 − 𝒃 is divisible by (𝒂 − 𝒃) by mathematical induction.
7. Using mathematical induction show that 𝟐𝒏 < 𝒏! for all 𝒏 ≥ 𝟒.
8. Determine the numbers between 1 and 250 that are not divisible by any of the integers
2 or 3 or 5 or 7.
9. Determine the numbers between 1 and 300 that are divisible by
(i) At least one of 3, 5, 7.
(ii) 3 and 5 but not by 7.
(iii) 5 but not by 3 and 7.
10. A survey of 500 from the school produce the following information. 200 plays volley ball, 120 plays
hockey, 60 plays both volley ball and hockey. How many are not playing either volley ball or hockey?
11. Determine the number of integers between 1 and 100 that
(i) not divisible by 7, 11 or 13
(ii) divisible by 3 but not by 7.
12. How many bit strings of length 10 contains
(i) Exactly 4 1’s .
(ii) At most 4 1’s.
(iii) At least 4 1’s.
(iv) An equal number of 0’s and 1’s.
13. From a committee of 6 men and 7 women, in how many ways can we select a committee of
(a) 3 men and 4 women.
(b) 4 members which has at least 1 women.
(c) 4 members has at most 1 men.
(d) 4 persons of both sexes.
(e) 4 persons in which Mr.and Mrs.Kannan is not included.
14. Solve the recurrence relation 𝒂𝒏 = 𝟔𝒂𝒏−𝟏 − 𝟗𝒂𝒏−𝟐 with 𝒂𝟎 = 𝟏 and 𝒂𝟏 = 𝟔.
15. Solve the recurrence relation 𝑭𝒏+𝟐 = 𝑭𝒏+𝟏 + 𝑭𝒏 , 𝒏 ≥ 𝟎 given that 𝑭𝟎 = 𝟐 and 𝑭𝟏 = 𝟏.
16. Solve the recurrence relation 𝒂𝒏+𝟐 − 𝟔𝒂𝒏+𝟏 + 𝟗𝒂𝒏 = 𝟑. 𝟐𝒏 + 𝟕. 𝟑𝒏 given that 𝒂𝟎 = 𝟏 and 𝒂𝟏 = 𝟒.
17. Solve 𝐒(𝐊) − 𝟕𝐒(𝐤 − 𝟏) + 𝟏𝟎𝐒(𝐤 − 𝟐) = 𝟖𝐤 + 𝟔 with 𝐒(𝟎) = 𝟏 and 𝐒(𝟏) = 𝟐.
18. Solve the recurrence relation 𝒂𝒏+𝟏 − 𝒂𝒏 = 𝟑𝒏𝟐 − 𝒏 with 𝒂𝟎 = 𝟑.
19. Using generating function solve the recurrence relation 𝒂𝒏 = 𝟑𝒂𝒏−𝟏 + 𝟏; 𝒏 ≥ 𝟏 for given that 𝒂𝟎 =
𝟏.
20. Solve the recurrence relation 𝑺𝒏) + 𝟑𝑺(𝒏 − 𝟏) + 𝟒𝑺(𝒏 − 𝟐) = 𝟎 where 𝒏 ≥ 𝟐 from that 𝑺(𝟎) = 𝟑,
𝑺(𝟏) = −𝟐 using generating function.
21. Solve the recurrence relation 𝒂𝒏 − 𝟕𝒂𝒏−𝟏 + 𝟏𝟎𝒂𝒏−𝟐 = 𝟎 for 𝒏 ≥ 𝟐 given that 𝒂𝟎 = 𝟏𝟎, 𝒂𝟏 = 𝟒𝟏
using generating function.
22. Solve the recurrence relation 𝒂𝒏+𝟐 − 𝟐𝒂𝒏+𝟏 + 𝒂𝒏 = 𝟐𝒏 , 𝒏 ≥ 𝟎 given that 𝒂𝟎 = 𝟐, 𝒂𝟏 = 𝟏 by using
generating function.
 K.L.N. COLLEGE OF ENGINEERING, POTTAPALAYAM-630 612.
(An Autonomous Institution affiliated to Anna University, Chennai)
DEPARTMENT OF MATHEMATICS
20BS303 – DISCRETE MATHEMATICS
Unit – II COMBINATORICS

TUTORIAL I
𝑛(𝑛+1)(2𝑛+1)
1. Using mathematical induction show that 12 + 22 + 32 + ⋯ + 𝑛2 = .
6

2. Show that 𝑛3 + 2𝑛 is divisible by 3 where 𝑛 ≥ 1 by

mathematical induction.
3𝑛+1 −1
3. Using mathematical induction show that ∑𝑛𝑟=0 3𝑟 = 2
.

4. Determine the numbers between 1 to 250 that are not divisible by any of the integers
2 or 3 or 5 or 7.

TUTORIAL II

1. A survey of 500 from the school produce the following information. 200 plays volley ball,
120 plays hockey, 60 plays both volley ball and hockey. How many are not playing either
volley ball or hockey?
2. Determine the number of integers between 1 to 100 that
(i) not divisible by 7, 11 or 13
(ii) divisible by 3 but not by 7.
3. Solve the recurrence relation 𝒂𝒏 = 𝟔𝒂𝒏−𝟏 − 𝟗𝒂𝒏−𝟐 with 𝒂𝟎 = 𝟏 and 𝒂𝟏 = 𝟔.
4. Solve the recurrence relation 𝒂𝒏+𝟐 − 𝟔𝒂𝒏+𝟏 + 𝟗𝒂𝒏 = 𝟑. 𝟐𝒏 + 𝟕. 𝟑𝒏 given that 𝒂𝟎 = 𝟏
and 𝒂𝟏 = 𝟒.

TUTORIAL III

1. Using generating function solve the recurrence relation 𝑎𝑛 = 3𝑎𝑛−1 + 1; 𝑛 ≥ 1 for

given that 𝑎0 = 1.
2. Solve the recurrence relation 𝑎𝑛 − 7𝑎𝑛−1 + 10𝑎𝑛−2 = 0 for 𝑛 ≥ 2 given that 𝑎0 = 10,
𝑎1 = 41 using generating function.
3. Solve the recurrence relation 𝑆𝑛) + 3𝑆(𝑛 − 1) + 4𝑆(𝑛 − 2) = 0 where 𝑛 ≥ 2 from that
𝑆(0) = 3, 𝑆(1) = −2 using generating function.
4. Solve the recurrence relation 𝑎𝑛+2 − 2𝑎𝑛+1 + 𝑎𝑛 = 2𝑛 , 𝑛 ≥ 0 given that 𝑎0 = 2, 𝑎1 = 1
by using generating function.
 K.L.N. COLLEGE OF ENGINEERING
(An Autonomous Institution, Affiliated to Anna University, Chennai)
DEPARTMENT OF MATHEMATICS
20BS303 – Discrete Mathematics
Assignment 2
D.O.A: D.O.S:
Unit – II COMBINATORICS

1. Show that 𝟖𝒏 − 𝟑𝒏 is a multiple of 5 by using mathematical induction.

𝟏 𝟏 𝟏 𝟏 𝒏
2. Show that 𝟏 . 𝟐
+𝟐 . 𝟑+𝟑 . 𝟒+ ⋯ + 𝒏 (𝒏+𝟏) = 𝒏+𝟏 by mathematical induction.

3. Determine the number of integers between 1 to 100 that are divisible by

(i) 2, 3, 5 or 7.
(ii) 2, 3, 5 but not by 7.
4. Determine the number of positive integers , 𝟏 ≤ 𝒏 ≤ 𝟏𝟎𝟎𝟎, that are not divisible by 2, 3 or 5 but
are divisible by 7.
5. Solve the recurrence relation 𝒂𝒏 = 𝒂𝒏−𝟏 + 𝟐𝒂𝒏−𝟐 with 𝒂𝟎 = 𝟐 and 𝒂𝟏 = 𝟕.
6. Solve the recurrence relation 𝒂𝒏 = 𝟔𝒂𝒏−𝟏 − 𝟏𝟏𝒂𝒏−𝟐 + 𝟔𝒂𝒏−𝟑 with the initial conditions 𝒂𝟎 = 𝟐, 𝒂𝟏 =
𝟓 and 𝒂𝟐 = 𝟏𝟓 .
7. Determine an explicit formula for the Fibonacci sequence 𝒇𝒏 = 𝒇𝒏−𝟏 + 𝒇𝒏−𝟐 with 𝒇𝟎 = 𝟎 and 𝒇𝟏 = 𝟏.
8. Solve the recurrence relation 𝒂𝒏+𝟐 − 𝒂𝒏+𝟏 − 𝟔𝒂𝒏 = 𝟎 , given that 𝒂𝟎 = 𝟐, 𝒂𝟏 = 𝟏 by using
generating functions.