Discrete Mathematics

Homework #1

26.05.2025

1. The statement “x + 2 = 7, for x = 3” is

A. Proposition False
B. Proposition True
C. Not a Proposition
D. Proposition both True and False
2. If p is false and q is true, then (p ∨ ¬q) → (p ∧ q) is
A. False
B. True
C. Neither true nor false
D. Both true and false
3. If p is true and q is false, then p → q is
A. False
B. True
C. Neither true nor false
D. Both true and false

4. A compound proposition (p ∧ q) → p is
A. Tautology
B. Contradiction
C. Contingency
D. Equivalent

1
5. Let p be a proposition. Then p ∨ ¬p is logically equivalent to
A. True
B. False
C. p
D. q
6. Express the statement “Every student in your class has taken a course in
computer”. Let P (x) be “x has taken a course in computer”, where the
domain of x is the set of students in your class.
A. ∀xP (x)
B. ∃xP (x)
C. ∀x¬P (x)
D. P (x)
7. Find the output of the following combinatorial circuit.

A. ¬(p ∧ q)
B. ¬p ∧ ¬q
C. ¬(p ∨ q)
D. p ∧ q

8. Find the output of the following combinatorial circuit.

a) ¬p ∨ ¬q
b) ¬(p ∨ p ∧ q)
c) (¬p ∧ q) ∨ p
d) ¬p ∧ (p ∨ ¬q)

2
 9. Let p be a proposition and T stands for True. Then p ∨ T is logically
equivalent to
A. True
B. False
C. p
D. q
10. If p is true and q is false, then p ⊕ q is
a) False
b) True
c) Neither true nor false
d) Both true and false
11. Let p and q be the propositions:
p: The automated reply can be sent.
q: The file system is full.
Express the following statement using p and q and logical connectives:
“The automated reply cannot be sent when the file system is full.”
a) p → q
b) q → ¬p
c) q → p
d) p → ¬q
12. Let p be a proposition and F stands for False, then p ∨ F is logically
equivalent to
a) True
b) False
c) p
d) q

13. Let p be a proposition and T stands for True, then p ∧ T is logically

equivalent to
a) True
b) False
c) p
d) q

3
14. Let p and q be two propositions, then p → q is logically equivalent to
a) p ∨ q
b) p ∧ q
c) ¬p ∨ q
d) q → p
15. Express the statement “Every student in UCAS has an email”. Where
P (x) is “x in UCAS”, F (x) is “x has an email”. The domain of x is the
set of all students in Palestine.
a) ∀xF (x)
b) ∀xP (x)
c) ∀x(P (x) ∧ F (x))
d) ∀x(P (x) → F (x))
16. True or False

# Statement T F

1 The proposition p → q is always false when p is true and q is false.

2 The statement ∀x(P (x)∨Q(x)) is logically equivalent to ∀xP (x)∨

∀xQ(x).

3 A tautology is a proposition that is always true.

4 The negation of the statement “All students passed” is “All stu-

dents failed.”

5 The compound proposition p ∧ ¬p is always false.

17. Let p and q be the propositions:

• p: “Swimming at the New Jersey shore is allowed”

• q: “Sharks have been spotted near the shore”
Express each of the following compound propositions as an English sen-
tence:

(a) ¬q
(b) p ∧ q
(c) ¬p ∨ q

4
 (d) p → ¬q
(e) ¬q → p
(f) ¬p → ¬q

18. Let p, q, and r be the propositions:

• p: “You get an A on the final exam.”

• q: “You do every exercise in this book.”
• r: “You get an A in this class.”

Write the following propositions using p, q, and r and logical connectives

(including negations):

(a) You get an A in this class, but you do not do every exercise in this
book.
(b) You get an A on the final, you do every exercise in this book, and
you get an A in this class.
(c) To get an A in this class, it is necessary for you to get an A on the
final.
(d) You get an A on the final, but you don’t do every exercise in this
book; nevertheless, you get an A in this class.
(e) Getting an A on the final and doing every exercise in this book is
sufficient for getting an A in this class.
(f) You will get an A in this class if and only if you either do every
exercise in this book or you get an A on the final.

19. Express these system specifications using the propositions:

• p: “The user enters a valid password”

• q: “Access is granted”
• r: “The user has paid the subscription fee”

and logical connectives (including negations):

(a) The user has paid the subscription fee, but does not enter a valid
password.
(b) Access is granted whenever the user has paid the subscription fee and
enters a valid password.
(c) Access is denied if the user has not paid the subscription fee.
(d) If the user has not entered a valid password but has paid the sub-
scription fee, then access is granted.

5
20. Show that each of these conditional statements is a tautology by using
truth tables:

(a) (p ∧ q) → p
(b) p → (p ∨ q)
(c) ¬p → (p → q)
(d) (p ∧ q) → (p → q)

21. Use truth tables to verify the absorption laws:

(a) p ∨ (p ∧ q) ≡ p
(b) p ∧ (p ∨ q) ≡ p

22. Use De Morgan’s laws to find the negation of each of the following state-
ments:

(a) Kwame will take a job in industry or go to graduate school.

(b) Yoshiko knows Java and calculus.
(c) James is young and strong.
(d) Rita will move to Oregon or Washington.

23. Let C(x) be the statement “x has a cat,” let D(x) be the statement “x
has a dog,” and let F (x) be the statement “x has a ferret.” Express each
of these statements in terms of C(x), D(x), F (x), quantifiers, and logical
connectives. Let the domain consist of all students in your class.

(a) A student in your class has a cat, a dog, and a ferret.

(b) All students in your class have a cat, a dog, or a ferret.
(c) Some student in your class has a cat and a ferret, but not a dog.
(d) No student in your class has a cat, a dog, and a ferret.

24. Let P (x) be the statement “x = x2 .” If the domain consists of the integers,
what are these truth values?

(a) P (0)
(b) P (1)
(c) P (2)
(d) P (−1)
(e) ∃xP (x)
(f) ∀xP (x)

6
25. Determine the truth value of each of these statements if the domain con-
sists of all real numbers.

(a) ∃x(x3 = −1)

(b) ∃x(x4 < x2 )
(c) ∀x((−x)2 = x2 )
(d) ∀x(2x > x)

26. Translate each of these statements into logical expressions using predi-
cates, 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.

27. Express the negation of each of these statements in terms of quantifiers

without using the negation symbol.

(a) ∀x(x > 1)

(b) ∀x(x ≤ 2)
(c) ∃x(x ≥ 4)
(d) ∃x(x < 0)
(e) ∀x((x < −1) ∨ (x > 2))
(f) ∃x((x < 4) ∨ (x > 7))

28. Let M (x, y) be “x has sent y an e-mail message” and T (x, y) be “x has
telephoned y,” where the domain consists of all students in your class.
Use quantifiers to express each of these statements.

(a) Chou has never sent an e-mail message to Koko.

(b) Arlene has never sent an e-mail message to or telephoned Sarah.
(c) Jose has never received an e-mail message from Deborah.
(d) Every student in your class has sent an e-mail message to Ken.
(e) No one in your class has telephoned Nina.

7
29. Let Q(x, y) be the statement “x + y = x − y.” If the domain for both
variables consists of all integers, what are the truth values?

(a) Q(1, 1)
(b) Q(2, 0)
(c) ∀yQ(1, y)
(d) ∃xQ(x, 2)
(e) ∃x∃yQ(x, y)
(f) ∀x∃yQ(x, y)
(g) ∃y∀xQ(x, y)
(h) ∀y∃xQ(x, y)
(i) ∀x∀yQ(x, y)

30. Use rules of inference to show that the hypotheses:

1. If it does not rain or if it is not foggy, then the sailing race will be
held and the lifesaving demonstration will go on.
2. If the sailing race is held, then the trophy will be awarded.
3. The trophy was not awarded.

imply the conclusion:

It rained.