FPT University

Course: Discrete mathematics

Course ID: MAD101

Student’s name: Group:

EXERCISES - CHAPTER 1
PART I (7 MARKS)
1. Determine whether these statements are true or false.
a) If 1 + 1 = 3, then unicorns exist.
b) 1 + 1 = 2 if and only if 2 + 3 = 4.
c) If 1 + 1 = 3, then dogs can fly.
d) 1 + 1 = 3 if and only if monkeys can fly.
e) 0 > 1 if and only if 2 > 1.

a) (q → ¬p) ∨ (¬p → ¬q)

2. How many rows appear in a truth table for each of these compound propositions?

b) (p ∨ ¬t) ∧ (p ∨ ¬s)
c) (p → r) ∨ (¬s → ¬t) ∨ (¬u → v)
d) (p ∧ r ∧ s) ∨ (q ∧ t) ∨ (r ∧ ¬t)
3. Construct a truth table for each of these compound propositions.

b) p  p ∨ q
a) p  p  q

c) p → r
d) ¬r  ¬p
e) ¬p  ¬r
4. (a) Find a proposition with the given truth table.

p q ?

T T F

T F F

F T T

F F F

(b) Find a proposition using only pq, and the connective  that has this truth table.

5. Write a proposition equivalent to p  q that uses only pq and the connective .

6. Write a proposition equivalent to p  q using only pq and the connective .

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

b) p  p ∨ q
a) pq  p (Simplification)

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

d) (p → r) ∧r] → p
(Disjunctive syllogism)

e) [p ∧ (p → q)]→ q
(Modus tollens)
(Modus Ponens)

a) p ∧ T ≡ p
8. Use truth tables to verify these equivalences.

b) p ∨ T ≡ T
c) p ∨ p ≡ p

e) ¬(p ∧ q) ≡¬p ∨¬q

d) ¬(¬p) ≡ p
(De Morgan’s Law)
9. Use De Morgan’s laws to find the negation of each of the following statements.
a) Minh knows Java and C++.
b) Rita will move to Oregon or Washington.
10. Write the negation of the following statements. (Don't write “It is not true that ….”)
a) It is Thursday and it is cold.
b) If it is rainy, then we go to the movies.
c) Khai or Anh are absent.
d) If it is sunny, then it is hot.
11. Let W(x) be the statement “the word x contains the letter a.” What are these truth values?
W(orange)
a) W(lemon)
b) W(true)
c) W(false)
 12. Determine the truth value of each of these statements if the domain for all variables

a) ∀x(x > 1  x2 > 1)

consists of real numbers.

b) ∀x(x > 1  x2 > 1)

c) ∀x(x > 1  x2 > 1)

a) ∀x(P(x)  Q(x))
13. Express the negations of each of these statements.

b) ∀x(P(x)  Q(x))
c) ∀x(P(x)  Q(x))
d) ∀x∃y(P(x,y) → Q(x, y))
14. Suppose the variable x represents students and y represents courses, and F(x): x is a
freshman A(x): x is a part-time student T(xy): x is taking y.
Write the statement using these predicates and any needed quantifiers.
a) Mikko is a freshman
b) Joe is not taking any course.
c) Some part-time students are not freshmen.
d) Every freshman is taking at least one course.

15. For each of these arguments determine whether the argument is correct or incorrect and
explain why.
a) Everyone enrolled in the FPT university has lived in a dorm. Van has never lived in a
dorm. Therefore, Van is not enrolled in the university.
b) A sport car is fun to drive. Tri’s car is not a sport. Therefore, Tri’s car is not fun to
drive.
c) Every IA major takes discrete mathematics. Cuong is taking discrete mathematics.
Therefore, Cuong is an IA major.
d) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird does not like
fruit.
e) Everyone who eats granola every day is healthy. Linda is not healthy. Therefore,
Linda does not eat granola every day.

PART II (3 MARKS)
16. Write each of these statements in the form “if p, then q” in English. [Hint: Refer to the list of
common ways to express conditional statements provided in this section.]
a) It is necessary to wash the boss’s car to get promoted.
b) A sufficient condition for the warranty to be good is that you bought the computer
less than a year ago.
c) Willy gets caught whenever he cheats.
 d) You can access the website only if you pay a subscription fee.
e) Carol gets seasick unless she is not on a boat.

a) p ∧ (p ∨ q) and p
17. Determine whether these pairs of compound propositions are logically equivalent or not.

b) (p ∧ q) v r and p ∧ (q v r)
c) p → r and p → ¬r
d) p → q and ¬q → ¬p
18. Suppose that the domain of the propositional function P(x) consists of the integers 1, 2, 3,
and 4. Express these statements without using quantifiers, instead using only negations,

a) ∃xP(x)
disjunctions, and conjunctions.

b) ∀xP(x)
c) ¬∃xP(x)
19. Determine whether the argument “If the earth is flat, then you can sail off the edge of the
earth. You cannot sail off the edge of the earth. Therefore, the earth is not flat” is valid or
not. Explain your choice.
20. Assume that the universe for x is all people and the universe for y is the set of all movies.
Write the English statement using the following predicates and any needed quantifiers:
S(xy): x saw y L(xy): x liked y A(y): y won an award C(y): y is a comedy.
a) No comedy won an award.
b) Lois saw Casablanca, but didn't like it.
c) Some people have seen every comedy.
d) No one liked every movie he has seen.
21. Assume that the universe for x is all people and the universe for y is the set of all movies.
Write the statement in good English, using the predicates:
S(xy): x saw y L(xy): x liked y.
Do not use variables in your answer
a) yS(Linhy)
b) yxL(xy)
c) xyL(xy)

THE END