Scribd
Upload
219 views

Discrete Structure Answer Key

The document discusses discrete mathematics topics such as propositions, logical connectives, truth tables, and Boolean search terms. It provides examples of propositions and evaluates their truth values. It also expresses logical statements using variables and connectives and constructs truth tables to evaluate compound propositions.

Uploaded by

Fernando Tangin
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
219 views

Discrete Structure Answer Key

The document discusses discrete mathematics topics such as propositions, logical connectives, truth tables, and Boolean search terms. It provides examples of propositions and evaluates their truth values. It also expresses logical statements using variables and connectives and constructs truth tables to evaluate compound propositions.

Uploaded by

Fernando Tangin
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Section 1.1, selected answers e.

Getting an A on the final and doing every exercise in


Math 114 Discrete Mathematics this book is sufficient for getting an A in this class. p∧q → r.
D Joyce, Spring 2018 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.
2. Which of the following are propositions? What are the r ←→ q ∨ p.
truth values of those that are propositions?
16. Which of these are inclusive ORs and which are exclu-
a. Do not pass go. Not a proposition; it’s a command. sive?
b. What time is it? Not a proposition; it’s a question. a. Experience with C++ or Java is required. Inclusive,
c. There are no black flies in Maine. It’s a proposition. since if you know both, that’s okay.
Right now, in January, it’s probably false. You might say b. Lunch includes soup or salid. Are you going to get
it’s not a proposition if you don’t consider the time to be both? Hardly. This is an exclusive OR.
fixed. c. To enter the country you need a passport or a voter
d. 4+x = 5. Not a proposition since there’s a free variable registration card. Inclusive, since it’s okay to have both.
x in it. d. Publish or perish. This means if you don’t publish
e. The moon is made of green cheeese. A false proposition research, you’ll lose your job. But it’s possible to publish
f. 2n ≥ 100. Not a proposition since there’s a free vari- and still perish. Inclusive.
abile n in it.
32. Construct a truth table for the compound propositions.
4. Let p and q be the propositions “I bought a lottery ticket a. (p ∨ q) ∨ r.
this week,” and “I won the million dollar jackpot on Friday,”
respectively. Express each of the following propositions as p q r p∨q (p ∨ q) ∨ r
an English sentence. T T T T T
There are many ways each one can be expressed. Your T T F T T
answers may differ from the ones here. T F T T T
T F F T T
a. ¬p. I didn’t buy a lottery ticket this week.
F T T T T
b. p ∨ q. I bought a lottery ticket this week, or I won the
F T F T T
million dollar jackpot on Friday.
F F T F T
c. p → q. If I bought a lottery ticket this week, then I
F F F F F
won the million dollar jackpot on Friday.
d. p ∧ q. I bought a lottery ticket this week, and I won c. (p ∧ q) ∨ r.
the million dollar jackpot on Friday.
e. p ↔ q. I bought a lottery ticket this week if and only p q r p∧q (p ∧ q) ∨ r
if I won the million dollar jackpot on Friday. T T T T T
f. ¬p → ¬q. If I didn’t buy a lottery ticket this week, T T F T T
then I didn’t win the million dollar jackpot on Friday. T F T F T
g. ¬p ∧ ¬q. I didn’t buy a lottery ticket this week, and I T F F F F
didn’t win the million dollar jackpot on Friday. F T T F T
F T F F F
h. ¬p ∨ (p ∧ q). Either I didn’t buy a lottery ticket this
F F T F T
week, or I did and I won the million dollar jackpot on Friday.
F F F F F
10. Let p be the proposition “you get an A on the final
e. (p ∨ q) ∧ ¬r.
exam,” let q be the proposition “you do every exercise in
this book,” and let r be the proposition “you get an A in p q r p ∨ q ¬r (p ∨ q) ∧ ¬r
this class.” Write these propositions using p, q, and r and T T T T F F
logical connectives. T T F T T T
a. You get an A in this class, but you do not do every T F T T F F
exercise in this book. r ∧ ¬q. T F F T T T
b. You get an A on the final, you do every exercise in this F T T T F F
book, and you get an A in this class. p ∧ q ∧ r. F T F T T T
c. To get an A in this class, it is necessary for you to get F F T F F F
an A on the final. r → p. F F F F T F
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 54. What Boolean search would you use to look for web
class. p ∧ ¬q ∧ r. pages about hiking in West Virginia? What if you wanted

1
to find web pages about hiking in Virginia, but not in West
Virginia.
First, hiking AND West AND Virginia. Second, hiking
AND Virginia AND NOT West. With most search engines,
you would simply write
hiking West Virginia
hiking West -Virginia
Furthermore, most search engines allow strings to be spec-
ified, like “West Virginia” which require the word West to
immediately precede Virginia. With those, the first answer
could be: hiking AND “West Virginia”, and the second: hik-
ing AND Virginia AND NOT “West Virginia”. Note that
BUT NOT is the same as AND NOT.
62. Five friends have access to a chat room. Is it possible
to determine who is chatting if the following information is
known?
1. Either Kevin or Heather, or both, are chatting.
2. Either Randy or Vijay, but not both, are chatting.
3. If Abbey is chatting, so is Randy.
4. Vijay and Keven are either both chatting or neither is.
5. If Heather is chatting, then so are Abby and Kevin.
Explain your reasoning.
It’s easiest to use symbolic notation. Then we have the
following five propostions.
1. K ∨ H.
2. R ⊕ V .
3. A → R.
4. V ↔ K.
5. H → A ∧ K.
There are many ways to proceed. Here’s one. Note that 1
and 5 both involve K and H. 1 says either K or H, but
5 says that if H, then also A ∧ K, so K in that case, too.
Thus, H occurs whenever K occurs, so in all cases K. Now
1 is satisfied.
So we now know K. By 4, therefore also V , and 4 is
now satisfied. By 2, therefore ¬R, and 2 is satisfied. Then
by 3, therefore ¬A, and 3 is satisfied. But by 5, since ¬A,
therefore ¬H, and 5 is satisfied.
By now, we’ve satisfied all five statements in the only way
possible, namely, with K, V , but not R, not A, and not H.
Thus, the answer to the question is: we can conclude that
Kevin and Vijay are chatting, but the other three aren’t.

Math 114 Home Page at http://math.clarku.edu/


~djoyce/ma114/

You might also like