" Daniel Bergman

Discrete Mathematics, Chapter 1.1

4) a. Jennifer and Teja are not friends. b. There are not 13 items in a baker's dozen. c. Abby didn't send
more than 100 text messages every day. d. 121 is not a perfect square.
6) a. 1 b. 1 c. 0 d. 0 e. 0
9) a. Sharks have not been spotted near the shore. b.
Swimming at the New Jersey shore is allowed and sharks have been spotted near the shore. g.
Swimming at the New Jersey shore is allowed if and only if sharks have been spotted near the shore. h.
Swimming at the New Jersey shore is always allowed when no sharks have been spotted near the shore.
Otherwise, swimming is not allowed at the New Jersey shore.
12) e. If either you have the flu or you miss the final examination you will not pass the course. f. You
cannot miss the final examination and pass the course unless you also have the flu.
22) a. Only if one washes the boss's car will they then get promoted. b. If there are winds from the south
then there will be a spring thaw. c. If you bought the computer less than a year a year ago then the
warranty will be good. d. If Willy cheats then he gets caught. e. If you pay a subscription fee only then
can you access the website. f. If and only if you know the right people then you get elected. g. If Carol is
on a boat then she gets seasick.
24) a. Only if you send me an e-mail message will I then remember to send you the address. b. If you
are born in the United States then you are a citizen of this country. c. If you keep your textbook then it
will be a useful reference in your future courses. d. If their goalie plays well then the Red Wing will win
the Stanely Cup.
27)
Converse Contrapositive Inverse

A If I ski tomorrow it If I don't ski If it does not snow

snowed today. tomorrow it did not today then I will not
snow today. ski tomorrow.

B Whenever there is going Only when there I don't come to class

to be a quiz I come to will not be a quiz I when there will not
class. don't come to class. be a quiz.

C If it has no divisors other If it has divisors A positive will not be

than 1 and itself, a other than 1 and prime only if it has
positive integer will itself, a positive integers other than
always be prime. integer will never be 1 and itself.
prime.
33) a.
P Q PvQ PQ (PvQ) ->
(PQ)

1 1 1 0 0

1 0 1 1 1

0 1 1 1 1

0 0 0 0 1
" Daniel Bergman

b.
P Q PvQ PQ (PQ)->
(PvQ)

1 1 1 0 1

1 0 1 1 1

0 1 1 1 1

0 0 0 0 0
36)
a.
P Q R PvQ (PvQ)vR

1 1 1 1 1

1 0 1 1 1

0 1 1 1 1

0 0 1 0 1

1 1 0 1 1

1 0 0 1 1

0 1 0 1 1

0 0 0 0 0

b.
P Q R PvQ (PvQ)^R

1 1 1 1 1

1 0 1 1 1

0 1 1 1 1

0 0 1 0 0

1 1 0 1 0

1 0 0 1 0

0 1 0 1 0

0 0 0 0 0
" Daniel Bergman

c.
P Q R P^Q (P^Q)vR

1 1 1 1 1

1 0 1 0 1

0 1 1 0 1

0 0 1 0 1

1 1 0 1 1

1 0 0 0 0

0 1 0 0 0

0 0 0 0 0

d.
P Q R P^Q (P^Q)^R

1 1 1 1 1

1 0 1 0 0

0 1 1 0 0

0 0 1 0 0

1 1 0 1 0

1 0 0 0 0

0 1 0 0 0

0 0 0 0 0

e.
P Q R ~R PvQ (PvQ)^~R

1 1 1 0 1 0

1 0 1 0 1 0

0 1 1 0 1 0

0 0 1 0 0 0
" Daniel Bergman

1 1 0 1 1 1

1 0 0 1 1 1

0 1 0 1 1 1

0 0 0 1 0 0

f.
P Q R ~R PvQ (PvQ)v~R

1 1 1 0 1 1

1 0 1 0 1 1

0 1 1 0 1 1

0 0 1 0 0 0

1 1 0 1 1 1

1 0 0 1 1 1

0 1 0 1 1 1

0 0 0 1 0 1

43) a. or 1111, 0011 and 0100, 0000 xor 0011, 0011

" Daniel Bergman
" Daniel Bergman

1.2

4) DvS -> W
8) a. R^~P B) P^R -> Q C) ~R -> ~Q D) R^~P ->Q
12) The specifications are consistent only if the file system is locked and new messages are being
queued
15) What would you say if I asked you which way to go? (1 of 2 possible answers,
basedhttp://scottbradlee.wordpress.com/2010/01/29/liar-truth-teller-and-the-wonders-of-inductive-
reasoning/ regarding all similar questions, and verified by author. See truth table I made below.)
Truth-Teller or Liar Right way or Wrong Way What he would say What he would say he
(P) (Q) (P^Q) v (~P^~Q) would say. (P^Q) v
(~P^~(~P^~Q))
1 1 1 1
1 0 0 0
0 1 0 1
0 0 1 0

17) If any of them didnt want coffee they would know that someone didnt want coffee. Thus the first two
professors must want coffee, because they dont know. The third one knows, and since the others want
coffee, it must mean that he doesnt want it.
27) A is the knight, B is the spy, C is the knave.
29) All solutions are possible, since A, B, or C could all be telling the truth that they are the Knight, and
each of the others could be either the spy or the knave and still be lying.
34) Randy and Vijay cannot both be chatting. Therefore, it must be Heather is not chatting, because that
would mean that both Abby and Kevin were chatting, and Abby always brings Randy to chat, while Kevin
always bring Vijay. Thus Abby and Kevin cant chat at the same time, and Heather cant chat at all. Since
~ know that if Heather is not chatting, Kevin is, we conclude that Kevin and Vijay are indeed chatting, and
that means that no one else can be chatting at the same time.
35) The butler and cook must be lying. The gardener and the handyman may be telling the truth or lying,
but they cant both be lying. Reasoning: The butler cant tell the truth unless the cook is too. But if he was
telling the truth, the gardener and handyman would both have to be lying, since cook and gardener cant
both tell the truth, and handyman cant tell the truth without the cook lying. But we know that they cant
both be lying at the same time. However, either of them can still lie and that doesnt preclude that the
cook is lying too. All we know is that at least one of them, and possibly both, may be telling the truth.
40) a) ~p v ~q b) ~p v ~(~p^q)

1.3
5)

P Q R 1. QvR 2. P^Q 3. P^R 4. P ^ 1 5. 2 v 3

T T 1 1 1 1 1 1
T T 0 1 1 0 1 1
T F 1 1 0 1 1 1
T F 0 0 0 0 0 0
F T 1 1 0 0 0 0
F T 0 1 0 0 0 0
F F 1 1 0 0 0 0
F F 0 0 0 0 0 0
" Daniel Bergman

6)

P Q ~P ~Q ~(P^Q) ~P v ~ Q

1 1 0 0 0 0

1 0 0 1 1 1

0 1 1 0 1 1

0 0 1 1 1 1

7d) P = Ibrahim is smart Q = Ibrahim is hard working. P ^ Q = ~(~P v ~Q) ~( P ^ Q) = ~P v ~Q.

Therefore the negation is that Ibrahim is either not smart or not hard working.

8d) P = Rita will move to Oregon Q = Rita will move to Washington. P v Q = ~(~P ^ ~Q)

~(p v q) = ~P ^ ~Q The negation would be that Rita will move to neither Washington not Oregon.

10 a)

P Q ~P 1) PvQ 2) ~P ^1 2 -> P

1 1 0 1 0 1

1 0 0 1 0 1

0 1 1 1 0 1

0 0 1 0 0 1

d)

P Q R 2. Q->R 3. PvQ` 4. P->R 5. 2^3^4 6. 5->R

T T 1 1 1 1 1 1
T T 0 0 1 0 0 0
T F 1 1 1 1 1 1
T F 0 1 0 0 0 0
F T 1 1 1 1 1 1
F T 0 0 1 1 0 0
F F 1 1 1 1 1 1
F F 0 1 0 1 0 0

14) (p (p q))q = (p (~p v q))q = ~p ^ (p ^ ~q) -> q

= F ^ ~q -> ~q. -> <-

" Daniel Bergman

22) (p q) (p r) = p (q r)

(p q) (p r) = (~p v q) ^ (~p v r) = ~p v (q^r) = p (q r)

31)

P Q R 1. Q->R 2. P -> 1. 3. P->Q 4. 3 ->R 2=4

1 1 1 1 1 1 1 1
1 1 0 0 0 1 0 1
1 0 1 1 1 0 1 1
1 0 0 1 1 0 1 1
0 1 1 1 1 1 1 1
0 1 0 0 1 1 0 0
0 0 1 1 1 1 1 1
0 0 0 1 1 1 0 0

It fails when P and R are both 0.

62) a. It is satisfiable when P ^ ~S.

b. It is satisfiable when ~P ^ Q ^ ~S.