100% found this document useful (1 vote)
125 views

Ass 1 Q

This document contains a discrete mathematics assignment with 32 problems involving logic, proofs, predicates, quantifiers and other concepts. The problems cover topics like determining propositions, truth values, conditional/biconditional statements, equivalences, counterexamples and different proof techniques.

Uploaded by

Devu Narayana
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
100% found this document useful (1 vote)
125 views

Ass 1 Q

This document contains a discrete mathematics assignment with 32 problems involving logic, proofs, predicates, quantifiers and other concepts. The problems cover topics like determining propositions, truth values, conditional/biconditional statements, equivalences, counterexamples and different proof techniques.

Uploaded by

Devu Narayana
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
You are on page 1/ 5

SRM University-AP, Amaravati

Department of Mathematics

Discrete Mathematics (MAT 141)

Assignment 1: The Foundations: Logic and Proofs

1. Which of the following sentences are propositions? What are the truth values of those which are
propositions?

(a) Vijayawada is the capital of India. (h) 1 + x = 2, ∀x 6= 1 and domain is the set of

(b) 6 + 3 = 5. real numbers.

(c) 3 + 7 = 10. (i) ∃x such that 2 + x = 3 and domain is the set

(d) x + 3 = 9. of real numbers.

(e) Give me a pen. (j) 3 + x = 5, ∀x 6= 1 and domain is the set of

(f) Who are you? real numbers.

(g) The sun rises in the east. (k) n2 ≥ 50.

2. Let p, q, and r be the propositions


p : You have fever.
q : You miss the final examination.
r : You pass the course.
Express each of these propositions as an English sentence.

(a) p → q (d) p ∨ q ∨ r

(b) ¬q ↔ r (e) (p → ¬r) ∨ (q → ¬r)

(c) q → ¬r (f) (p ∧ q) ∨ (¬q ∧ r)

3. Determine whether each of these conditional statements is true or false.

(a) If 1 + 1 = 2, then 2 + 2 = 5. (c) If 1 + 1 = 3, then 2 + 2 = 5.

(b) If 1 + 1 = 3, then 2 + 2 = 4. (d) If monkeys can fly, then 1 + 1 = 3.

4. Determine whether these biconditional statements are true or false.

(a) 2 + 2 = 4 if and only if 1 + 1 = 2. (c) 1 + 1 = 3 if and only if monkeys can fly.

(b) 1 + 1 = 2 if and only if 2 + 3 = 4. (d) 0 > 1 if and only if 2 > 1

1
5. State the converse, contrapositive, and inverse of each of these conditional statements.

(a) If it rains, then I will stay at home.

(b) I go to the beach whenever I am free.

(c) When I stay up late, it is necessary that I sleep until noon.

6. Construct the truth table for each of these compound propositions.

(a) p ∧ ¬p (g) (p ↔ q) ⊕ (¬p ↔ q)

(b) (p ∨ ¬q) → q
(h) (p ↔ q) ⊕ (¬p ↔ ¬r)
(c) (p ∨ q) → (p ∧ q)
(i) (p → q) ∧ (¬p → r)
(d) (p → q) ↔ (¬q → ¬p)
(j) (p ↔ q) ∨ (¬q ↔ r)
(e) (p → q) → (q → p)

(f) (p ⊕ q) → (p ∧ q) (k) (¬p ↔ ¬q) ↔ (q ↔ r)

7. Use truth tables to verify these equivalences.

(a) p ∧ T ≡ p (f) p ∧ p ≡ p

(b) p ∧ F ≡ F (g) p ∨ q ≡ q ∨ p

(c) p ∨ p ≡ p (h) p ∧ q ≡ q ∧ p

(d) p ∨ F ≡ p (i) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)

(e) p ∨ T ≡ T (j) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r)

8. Show that each of these conditional statements is a tautology by using truth tables.

(a) [¬p ∧ (p ∨ q)] → q (c) [p ∧ (p → q)] → q

(b) [(p → q) ∧ (q → r)] → (p → r) (d) [(p ∨ q) ∧ (p → r) ∧ (q → r)] → r

9. Show that ¬(p ↔ q) and ¬p ↔ q are logically equivalent.

10. Show that (p → q) ∨ (p → r) and p → (q ∨ r) are logically equivalent.

11. Show that ¬p → (q → r) and q → (p ∨ r) are logically equivalent.

12. Show that (p ∨ q) ∧ (¬p ∨ r) → (q ∨ r) is a tautology.

13. Translate these statements into English, where C(x) is “x is a comedian” and F (x) is “x is
funny” and the domain consists of all people.

2
(a) ∀x(C(x) → F (x)) (c) ∀x(C(x) ∧ F (x))

(b) ∃x(C(x) → F (x)) (d) ∃x(C(x) ∧ F (x))

14. Let Q(x) be the statement “x + 2 > 2x”. If he domain consists of all integers, what are these
truth values?

(a) Q(0) (e) ∀xQ(x)

(b) Q(−1)
(f) ∃x¬Q(x)
(c) Q(1)

(d) ∃xQ(x) (g) ∀x¬Q(x)

15. Determine the truth value of each of these statements if the domain consists of all real numbers.

(a) ∃x(x5 = 5) (c) ∀x((−x)4 = x4 )

(b) ∃x(x2 < 3x) (d) ∀x(2x > x + 2)

16. What are the negations of the statement ∀x(x4 > x2 ) and ∃x(x3 = 7) ?

17. Let S(x) be the statement “x is a student”, F (x) the statement “x is a faculty”, and A(x, y) the
predicate “x has asked a question to y”, where the domain consists of all people associated with
your college. Use quantifiers to express each of these statements.

(a) Every student has asked Professor Gross a question.

(b) Every faculty member has either asked Professor Miller a question or been asked a question
by Professor Miller.

(c) Some students has not asked any faculty member a question.

(d) There is a faculty member who has never been asked a question by a student.

(e) Some student has asked every faculty member a question.

(f) There is a faculty member who has asked every other faculty member a question.

(g) Some student has never been asked a question by a faculty member.

18. Express each of these statements using predicates, quantifiers, logical connectives, and mathe-
matical operators where the domain consists of all integers.

(a) The product of two negative integers is positive.

(b) The average of two positive integers is positive.

3
(c) The difference of two negative integers is not necessarily negative.

(d) The absolute value of the sum of two integers does not exceed the sum of the absolute
values of these integers.

19. Translate each of these nested quantifications into an English statement that express a mathe-
matical fact. The domain in each case consists of all real numbers.

(a) ∃x∀y(xy = y)

(b) ∀x∀y(((x < 0) ∧ (y > 0)) → (xy < 0))

(c) ∀x∀y∃z(x + y = 5z)

20. Determine the truth value of each of these statements if the domain of each variable consists of
all real numbers.

(a) ∀x∃y(x2 = 3y) (f) ∃x∃y(x + 2y = 2 ∧ 2x + 4y = 5)

(b) ∃x∀y(xy = 0) (g) ∀x∃y(x + y = 2 ∧ 2x − y = 1)

(c) ∀x(x 6= 0 → ∃y(xy = 1)) (h) ∀x∀y∃z(z = (x + y)/2)

(d) ∃x∀y(y 6= 0 → xy = 1) (i) ∀x∃y(x = y 2 )

(e) ∀x∃y(x + y = 1) (j) ∃x∃y(x + y 6= y + x)

21. 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 involved logical connectives).

(a) ¬∃y∃xP (x, y) (d) ¬∃y(∀x∃zT (x, y, z) ∨ ∃x∀zU (x, y, z))

(b) ¬∃y(Q(y) ∧ ∀x¬R(x, y)) (e) ¬∀x∃yP (x, y)

(c) ¬∃y(∃xR(x, y) ∨ ∀xS(x, y))

22. Find a counterexample, if possible, to these universally quantified statements, where the domain
for all variables consists of all integers.

(a) ∀x∀y(x2 = y 2 → x = y)

(b) ∀x∃y(y 2 = x)

(c) ∀x∀y(xy > x)

23. Establish the validity of the following argument forms using the rules of inferences.

4
(a) p → q (d) ¬q
¬q ¬r
¬r ¬p ∨ q ∨ r
∴ ¬(p ∨ r) ∴ ¬p

(b) p ∨ q
(e) (¬p ∨ q) → r
¬r
r → (s ∨ t)
¬p ∨ r
¬s ∧ ¬u
∴q
¬u → ¬t
∴ p
(c) p ∨ q
p→r (f) p → q
r→s ¬r ∨ s
∴q∨s p∨r
∴ ¬q → s

24. Use a direct proof to show that the product of two odd numbers is odd.

25. Prove or disprove that the product of a nonzero rational number and an irrational number is
irrational.

26. Use a proof by contraposition to show that if x + y ≥ 2, where x and y are real numbers,then
x ≥ 1 or y ≥ 1.

27. Prove that if m and n are integers and mn is even,then m is even or n is even.

28. Show that if n is an integer and n3 + 5 is odd,then n is even using


a) a proof by contraposition.
b) a proof by contradiction.

29. Let P (n) be the proposition “If a and b are positive real numbers, then (a + b)n ≥ an + bn .”
Prove that P (1) is true. What kind of proof did you use?

30. Use a proof by contradiction to show that there is no rational number r for which r3 + r + 1 = 0.

31. Prove that m2 = n2 if and only if m = n or m = −n.

32. Prove that these four statements about the integers n are equivalent: (i) n2 is odd, (ii) 1-n is
even, (iii) n3 is odd, (iv) n2 + 1 is even.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy