Scribd
Upload
10 views2 pages

Discrete Mathematics Tutorial 2 Solutions

The document outlines a tutorial for a B.Tech course in Discrete Mathematics, focusing on logical identities, quantifiers, and equivalences. It includes various exercises such as proving logical statements, simplifying expressions, and translating mathematical statements into English. The tutorial is designed for third-semester Computer Science & Engineering students for the academic year 2025-26.

Uploaded by

cefav97693
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views2 pages

Discrete Mathematics Tutorial 2 Solutions

The document outlines a tutorial for a B.Tech course in Discrete Mathematics, focusing on logical identities, quantifiers, and equivalences. It includes various exercises such as proving logical statements, simplifying expressions, and translating mathematical statements into English. The tutorial is designed for third-semester Computer Science & Engineering students for the academic year 2025-26.

Uploaded by

cefav97693
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Programme: [Link].

Semester: Third
Course Code: CSE 24231 Course Name: Discrete Mathematics
Branch: Computer Science & Engineering Academic Year: 2025-26
Tutorial 2 Date: July 24, 2025

1. Show that (p → q) ∧ (p → r) ≡ p → (q ∧ r) using only logical identities.

2. Establish the biconditional equivalence: p ↔ q ≡ (p ∧ q) ∨ (¬p ∧ ¬q) without using a truth


table.

3. Prove or disprove: ∀xP (x) ∨ ∀xQ(x) ≡ ∀x(P (x) ∨ Q(x)). (Hint: Try a counterexample.)

4. Simplify the expression using only identities: (p ∨ q) ∧ (p ∨ ¬q) ∧ (¬p ∨ r)

5. Show that ¬(p ∨ q) ∧ (p ∨ r) ≡ (¬p ∧ ¬q ∧ r) using De Morgan’s and distributive laws.

6. Rewrite the negation of ∃x∀y(P (x, y) → Q(y)) so that no negation is left of a quantifier.

7. Using counterexamples, show that ∃xP (x) ∧ ∃xQ(x) ̸≡ ∃x(P (x) ∧ Q(x)).

8. Express formally using predicates and quantifiers: “Every positive integer is the sum of the
squares of four integers.”

9. Translate into English and determine the truth of: ∃x∀y(x + y = y).

10. Use quantifier laws to prove ¬∃xP (x) ≡ ∀x¬P (x).

11. Translate the statement ∀x(C(x) ∨ ∃y(C(y) ∧ F (x, y))) into English. What does it mean in
terms of “computers and friends”?

12. Evaluate whether the order of quantifiers matters: ∃y∀xQ(x, y) vs ∀x∃yQ(x, y) using a
counterexample.

13. Consider the following statements:

a) No professors are ignorant.


b) All ignorant people are vain.
c) No professors are vain.

Does (c) follow from (a) and (b)? Justify your answer.
Computer Engineering Algorithm Design & Analysis Page 2 of 2

14. Analyze this argument:

“Babies are illogical. Nobody is despised who can manage a crocodile. Illogical
persons are despised.”

Does it follow that “Babies cannot manage crocodiles”? If not, find a correct conclusion.

Page 2

You might also like