DISCRETE MATHEMATCIS

ASSIGNMENT-I
Common to CSE and AI&DS
Max Marks: 40
(Each Question Carries 10 Marks)
UNIT-I & II

1. (i) Prove that without using truth table ¬p → (q → r) ≡ q → (p ∨ r). (4)

(ii) Prove that ((P ∨ Q) ∧ ¬(¬P ∧ (¬Q ∨ ¬R))) ∨ (¬P ∧ ¬Q) ∨ (¬P ∧ ¬R) is a
tautology by using equivalence. (6)

2. (i) Show, by indirect method ∀x(P (x) ∨ Q(x)) ⇒ ∀xP (x) ∨ ∃xQ(x) (4)
(ii) To show that the premises A student in this class has not read the book
and Everyone in this class passed the first exam imply the conclusion Someone
Who passed the first exam has not read the book (6)

3. By using mathematical induction method prove that (10)

n(n + 1)(2n + 1)
12 + 22 + . . . + n2 = .
6

4. Solve the recurrence relation an − 3an−1 = 2 with n ≥ 1 and a0 = 2 using

generating function method. (10)

♠♠♠♠♠♠

Due Date: 20-11-2023