3.

2 Predicates and Quantified Statements II 115

Example 3.2.6 Necessary and Sufficient Conditions

Rewrite the following statements as quantified conditional statements. Do not use the
word necessary or sufficient.
a. Squareness is a sufficient condition for rectangularity.
b. Being at least 35 years old is a necessary condition for being President of the United
States.
Solution
a. A formal version of the statement is
∀x, if x is a square, then x is a rectangle.
Or, in informal language:
If a figure is a square, then it is a rectangle.

b. Using formal language, you could write the answer as

∀ people x, if x is younger than 35, then x
cannot be President of the United States.
Or, by the equivalence between a statement and its contrapositive:
∀ people x, if x is President of the United States,
then x is at least 35 years old. ■

Example 3.2.7 Only If

Rewrite the following as a universal conditional statement:
A product of two numbers is 0 only if one of the numbers is 0.
Solution Using informal language, you could write the answer as
If neither of two numbers is 0, then the product of the numbers is not 0.
Or, by the equivalence between a statement and its contrapositive,
If a product of two numbers is 0, then one of the numbers is 0. ■

Test Yourself
1. A negation for “All R have property S” is “There is R 4. The converse of “For all x, if x has property P then x has
that .” property Q” is “ .”
2. A negation for “Some R have property S” is “ .” 5. The contrapositive of “For all x, if x has property P then x
has property Q” is “ .”
3. A negation for “For all x, if x has property P then x has
property Q” is “ .” 6. The inverse of “For all x, if x has property P then x has
property Q” is “ .”

Exercise Set 3.2

1. Which of the following is a negation for “All discrete math- c. There is an athletic person who is a discrete mathematics
ematics students are athletic”? More than one answer may student.
be correct. d. No discrete mathematics students are athletic.
a. There is a discrete mathematics student who is nonath- e. Some discrete mathematics students are nonathletic.
letic. f. No athletic people are discrete mathematics students.
b. All discrete mathematics students are nonathletic.

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
 116 Chapter 3 The Logic of Quantified Statements

2. Which of the following is a negation for “All dogs are Proposed negation: The product of any irrational number
loyal”? More than one answer may be correct. and any rational number is rational.
a. All dogs are disloyal. b. No dogs are loyal.
13. Statement: For all integers n, if n 2 is even then n is
c. Some dogs are disloyal. d. Some dogs are loyal.
even.
e. There is a disloyal animal that is not a dog.
Proposed negation: For all integers n, if n 2 is even then n is
f. There is a dog that is disloyal.
not even.
g. No animals that are not dogs are loyal.
h. Some animals that are not dogs are loyal. 14. Statement: For all real numbers x1 and x2 , if
x12 = x22 then x1 = x2 .
3. Write a formal negation for each of the following state-
ments: Proposed negation: For all real numbers x1 and x2 , if
a. ∀ fish x, x has gills. x12 = x22 then x1  = x2 .
b. ∀ computers c, c has a CPU. 15. Let D = {−48, −14, −8, 0, 1, 3, 16, 23, 26, 32, 36}.
c. ∃ a movie m such that m is over 6 hours long. Determine which of the following statements are true and
d. ∃ a band b such that b has won at least 10 Grammy which are false. Provide counterexamples for those state-
awards. ments that are false.
4. Write an informal negation for each of the following state- a. ∀x ∈ D, if x is odd then x > 0.
ments. Be careful to avoid negations that are ambiguous. b. ∀x ∈ D, if x is less than 0 then x is even.
a. All dogs are friendly. c. ∀x ∈ D, if x is even then x ≤ 0.
b. All people are happy. d. ∀x ∈ D, if the ones digit of x is 2, then the tens digit is
c. Some suspicions were substantiated. 3 or 4.
d. Some estimates are accurate. e. ∀x ∈ D, if the ones digit of x is 6, then the tens digit is
1 or 2.
5. Write a negation for each of the following statements.
a. Any valid argument has a true conclusion. In 16–23, write a negation for each statement.
b. Every real number is positive, negative, or zero.
16. ∀ real numbers x, if x 2 ≥ 1 then x > 0.
6. Write a negation for each of the following statements.
17. ∀ integers d, if 6/d is an integer then d = 3.
a. Sets A and B do not have any points in common.
b. Towns P and Q are not connected by any road on the 18. ∀x ∈ R, if x(x + 1) > 0 then x > 0 or x < −1.
map.
19. ∀n ∈ Z, if n is prime then n is odd or n = 2.
7. Informal language is actually more complex than formal
20. ∀ integers a, b and c, if a − b is even and b − c is even,
language. For instance, the sentence “There are no orders
then a − c is even.
from store A for item B” contains the words there are. Is
the statement existential? Write an informal negation for 21. ∀ integers n, if n is divisible by 6, then n is divisible by 2
the statement, and then write the statement formally using and n is divisible by 3.
quantifiers and variables.
22. If the square of an integer is odd, then the integer is odd.
8. Consider the statement “There are no simple solutions to
23. If a function is differentiable then it is continuous.
life’s problems.” Write an informal negation for the state-
ment, and then write the statement formally using quanti- 24. Rewrite the statements in each pair in if-then form and indi-
fiers and variables. cate the logical relationship between them.
Write a negation for each statement in 9 and 10. a. All the children in Tom’s family are female.
All the females in Tom’s family are children.
9. ∀ real numbers x, if x > 3 then x 2 > 9.
b. All the integers that are greater than 5 and end in 1, 3,
10. ∀ computer programs P, if P compiles without error mes- 7, or 9 are prime.
sages, then P is correct. All the integers that are greater than 5 and are prime
end in 1, 3, 7, or 9.
In each of 11–14 determine whether the proposed negation is
correct. If it is not, write a correct negation. 25. Each of the following statements is true. In each case write
the converse of the statement, and give a counterexample
11. Statement: The sum of any two irrational numbers showing that the converse is false.
is irrational.
a. If n is any prime number that is greater than 2, then
Proposed negation: The sum of any two irrational numbers
n + 1 is even.
is rational.
b. If m is any odd integer, then 2m is even.
12. Statement: The product of any irrational number c. If two circles intersect in exactly two points, then they
and any rational number is irrational. do not have a common center.

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
 3.3 Statements with Multiple Quantifiers 117

In 26–33, for each statement in the referenced exercise write the 40. Being divisible by 8 is a sufficient condition for being divis-
converse, inverse, and contrapositive. Indicate as best as you can ible by 4.
which among the statement, its converse, its inverse, and its con-
trapositive are true and which are false. Give a counterexample 41. Being on time each day is a necessary condition for keeping
for each that is false. this job.

26. Exercise 16 27. Exercise 17 42. Passing a comprehensive exam is a necessary condition for
obtaining a master’s degree.
28. Exercise 18 29. Exercise 19
Use the facts that the negation of a ∀ statement is a ∃ statement
30. Exercise 20 31. Exercise 21 and that the negation of an if-then statement is an and statement
32. Exercise 22 33. Exercise 23 to rewrite each of the statements 43–46 without using the word
necessary or sufficient.
34. Write the contrapositive for each of the following state-
ments. 43. Being divisible by 8 is not a necessary condition for being
a. If n is prime, then √n is not divisible by any prime num- divisible by 4.
ber between 1 and n strictly. (Assume that n is a fixed
integer that is greater than 1.) 44. Having a large income is not a necessary condition for a
b. If A and B do not have any elements in common, then person to be happy.
they are disjoint. (Assume that A and B are fixed sets.) 45. Having a large income is not a sufficient condition for a
35. Give an example to show that a universal conditional state- person to be happy.
ment is not logically equivalent to its inverse.
46. Being a polynomial is not a sufficient condition for a func-
✶ 36. If P(x) is a predicate and the domain of x is the set of tion to have a real root.
all real numbers, let R be “∀x ∈ Z, P(x),” let S be “∀x ∈
Q, P(x),” and let T be “∀x ∈ R, P(x).” 47. The computer scientists Richard Conway and David Gries
a. Find a definition for P(x) (but do not use “x ∈ Z”) so once wrote:
that R is true and both S and T are false. The absence of error messages during translation
b. Find a definition for P(x) (but do not use “x ∈ Q”) so of a computer program is only a necessary and
that both R and S are true and T is false. not a sufficient condition for reasonable [program]
37. Consider the following sequence of digits: 0204. A person correctness.
claims that all the 1’s in the sequence are to the left of all the Rewrite this statement without using the words necessary
0’s in the sequence. Is this true? Justify your answer. (Hint: or sufficient.
Write the claim formally and write a formal negation for it.
Is the negation true or false?) 48. A frequent-flyer club brochure states, “You may select
among carriers only if they offer the same lowest fare.”
38. True or false? All occurrences of the letter u in Discrete
Assuming that “only if” has its formal, logical meaning,
Mathematics are lowercase. Justify your answer.
does this statement guarantee that if two carriers offer
Rewrite each statement of 39–42 in if-then form. the same lowest fare, the customer will be free to choose
between them? Explain.
39. Earning a grade of C− in this course is a sufficient condi-
tion for it to count toward graduation.

Answers for Test Yourself

1. some (Alternative answers: at least one; an); does not have property S. 2. No R have property S. 3. There is an x such that x
has property P and x does not have property Q. 4. For all x, if x has property Q then x has property P. 5. For all x, if x does not
have property Q then x does not have property P. 6. For all x, if x does not have property P then x does not have property Q.

3.3 Statements with Multiple Quantifiers

It is not enough to have a good mind. The main thing is to use it well. — René Descartes

Imagine you are visiting a factory that manufactures computer microchips. The factory
guide tells you,
There is a person supervising every detail of the production process.

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.