Discrete Mathematics

Assignment #3 (Solution)
Q1. Consider each set of statements (argument), of which the last statement in each argument is the conclusion,
and the other statements are the premises. Express each argument using the quantifiers and predicates.
I.
A. All lions are fierce.
x (P(x)  Q(x))
B. Some lions do not drink coffee.
x (P(x)  ¬R(x))
C. Some fierce creatures do not drink coffee.
x (Q(x)  ¬R(x))
P(x): "X is a lion" Q(x): "X is fierce" R(x): "X drinks coffee"

II.
A. All hummingbirds are richly colored.
x (P(x)  S(x))
B. No large bird lives on honey.
¬x (Q(x)  R(x))
C. Birds that do not live on honey are dull in color.
x (¬R(x)  ¬S(x))
D. Hummingbirds are small.
x (P(x)  ¬Q(x))
P(x): "X is a hummingbird" Q(x): "X is large" R(x): "X lives on honey S(x): "X is richly colored"
Note: The universe of discourse for the first argument is the set of all creatures, and for the second argument is the set
of all birds.

Q2. The universe of discourse consists of all people. Translate these statements into English.
C(x): "X is a comedian" F(x): "X is funny"
A. x (C(x)  F(x))
Every comedian is funny.
B. x (C(x)  F(x))
Every person is a funny comedian.
C. x (C(x)  F(x))
There exists a person such that if he or she is a comedian, then he or she is funny.
D. x (C(x)  F(x))
Some comedians are funny.

Q3. Express each of these sentences in terms of P(x), Q(x), quantifiers, and logical connectives. The universe of
discourse for quantifiers consists of all students at your school.
P(x): "X can speak Russian" Q(x): "X knows the computer language C++"
A. There is a student at your school who can speak Russian and who knows C++.
x (P(x)  Q(x))
B. There is a student at your school who can speak Russian but who does not know C++.
x (P(x)  ¬Q(x))
C. Every student at your school either can speak Russian or knows C++.
x (P(x)  Q(x))
D. No student at your school can speak Russian or knows C++.
x ¬(P(x)  Q(x))
Page 1 of 4
 Q4. Determine the truth value of each of these statements if the universe of discourse consists of all integers.
A. n (n + 1 > n) T
B. n (2n = 3n) T
C. n (n = –n) T
D. n (n2  n) T
E. n (n  0)
2
T
F. n (n2 = 2) F
G. n (n < 0)
2
F

Q5. Suppose that the universe of discourse of the propositional function P(x) consists of the integers 0, 1, 2, 3, and
4. Write out each of these propositions using disjunctions, conjunctions, and negations.
A. x P(x) P(0)  P(1)  P(2)  P(3)  P(4)
B. x P(x) P(0)  P(1)  P(2)  P(3)  P(4)
C. x ¬P(x) ¬P(0)  ¬P(1)  ¬P(2)  ¬P(3)  ¬P(4)
D. x ¬P(x) ¬P(0)  ¬P(1)  ¬P(2)  ¬P(3)  ¬P(4)
E. ¬x P(x) ¬(P(0)  P(1)  P(2)  P(3)  P(4))
F. ¬x P(x) ¬(P(0)  P(1)  P(2)  P(3)  P(4))

Q6. Translate each of these statements into logical expressions using predicates, quantifiers, and logical
connectives. The domain is all people.
P(x): "X is perfect" F(x): "X is your friend"
A. No one is perfect.
x ¬P(x)
B. Not everyone is perfect.
¬x P(x)
C. All your friends are perfect.
x (F(x)  P(x))
D. One of your friends is perfect.
x (F(x)  P(x))
E. Everyone is your friend and is perfect.
x (F(x)  P(x)) or we can write it as (x F(x))  (x P(x))
F. Not everybody is your friend or someone is not perfect.
(¬x F(x))  (x ¬P(x))

Q7. Suppose that the universe of discourse of Q(x, y, z) consists of triples x, y, z, where x = 0, 1, or 2, y = 0 or 1,
and z = 0 or 1. Write out these propositions using disjunctions and conjunctions.
A. y Q(0, y, 0)
Q(0, 0, 0)  Q(0, 1, 0)
B. x Q(x, 1, 1)
Q(0, 1, 1)  Q(1, 1, 1)  Q(2, 1, 1)
C. z ¬Q(0, 0, z)
¬Q(0, 0, 0)  ¬Q(0, 0, 1)
D. x ¬Q(x, 0, 1)
¬Q(0, 0, 1)  ¬Q(1, 0, 1)  ¬Q(2, 0, 1)

Q8. Express each of these statements using quantifiers. Then form the negation of the statement, so that no
negation is to the left of a quantifier. Next express the negation in simple English.
A. Some old dogs can learn new tricks.
Let T(x): "X can learn new tricks", and let the domain be old dogs.
Page 2 of 4
 Original is x T(x). Negation is x ¬T(x): "No old dogs can learn new tricks."
B. No rabbit know calculus.
Let C(x): "X knows calculus", and let the domain be rabbits.
Original is ¬x C(x). Negation is x C(x): "There is a rabbit that knows calculus."
C. Every bird can fly.
Let F(x): "X can fly", and let the domain be birds.
Original is x F(x). Negation is x ¬F(x): "There is a bird that cannot fly."
D. There is no dog that can talk.
Let T(x): "X can talk", and let the domain be dogs.
Original is ¬x T(x). Negation is x T(x): "There is a dog that talk."
E. There is one in this class who knows French and Russian.
Let F(x): "X knows French", R(x): "X knows Russian", and let the domain be people in this class.
Original is ¬x (F(x)  R(x)). Negation is x (F(x)  R(x)): "There is someone in this class who knows
French and English."

Q9. Translate these statements into English, where the universe of discourse for each variable consists of all real
numbers.
A. x y (x < y)
For every real number x there exists a real number y such that x is less than y.
B. x y (((x  0)  (y  0))  (x  y  0))
For every real number x and real number y, if x and y are both nonnegative, then their product is nonnegative.
C. x y z (x  y = z)
For every real number x and real number y, there exists a real number z such that x multiply by y equal z.

Q10. Express each of the quantifications in English. The universe of discourse for quantifiers consists of all
students at your class.
Q(x, y): "X has sent an email message to Y"
A. x y Q(x, y)
There is some student in your class who has sent a message to some student in your class.
B. x y Q(x, y)
There is some student in your class who has sent a message to every student in your class.
C. x y Q(x, y)
Every student of your class has sent a message to at least one student in your class.
D. y x Q(x, y)
There is a student in your class who has been sent a message by every student in your class.
E. y x Q(x, y)
Every student in your class has been sent a message from at least one student in your class.
F. x y Q(x, y)
Every student in the class has sent a message to every student in the class.

Q11. Use quantifiers to express each of these statements. The universe of discourse for both x and y consists of all
people in the world.
L(x, y): "X respects Y"
A. Everybody respects "Jerry".
x L(x, Jerry)
B. Everybody respects somebody.
x y L(x, y)
C. There is somebody whom everybody respects.
y x L(x, y)
D. Nobody respects everybody.
Page 3 of 4
 x y ¬L(x, y)
E. There is somebody whom "Lydia" does not respect.
x ¬ L(Lydia, x)
F. There is somebody whom no one respects.
x y ¬ L(y, x)
G. There is exactly one person whom everybody respects.
x (y L(y, x)  z ((w L(w, z))  z = x))
H. There are exactly two people whom "Lynn" respects.
x y (x  y  L(Lynn, x)  L(Lynn, y)  z (L(Lynn, z)  (z = x  z = y)))
I. Everyone respects himself or herself.
x L(x, x)
J. There is someone who respects no one besides himself or herself.
x y (L(x, y)  x = y)

Q12. Express each of these statements using mathematical and logical operators, predicates, and quantifies, where
the universe of discourse consists of all integers.
A. The sum of two negative integers is negative.
x y (((x < 0)  (y < 0))  (x + y < 0))
B. The difference of two positive integers is not necessarily positive.
¬x y (((x > 0)  (y > 0))  (x – y > 0))
C. The sum of the squares of two integers is greater than or equal to the square of their sum.
x y (x2 + y2  (x + y)2)
D. The absolute value of the product of two integers is the product of their absolute values.
x y ( |x  y| = |x|  |y| )

Page 4 of 4