In-class Exercises (3)
Question 1
✘ Use rules of inference to show that the
hypotheses “Randy works hard,” “If Randy
works hard, then he is a dull boy,” and “If
Randy is a dull boy, then he will not get the job”
imply the conclusion “Randy will not get the
job.”
2
Question 1 (solution)
✘ Let w be the proposition "Randy works hard," let d be the
proposition "Randy is a dull boy," and let j be the proposition
"Randy will get the job." We are given premises w, w→ d _,
d → ¬j .We want to conclude ¬ j.
✘ We set up the proof in two columns, with reasons:
3
Question 2
✘ Explain which rules of inference are used for each
step.
“Doug, a student in this class, knows how to write
programs in JAVA. Everyone who knows how to write
programs in JAVA can get a high-paying job. Therefore,
someone in this class can get a high-paying job.”
4
Question 2 (solution)
5
Question 3
✘ Explain which rules of inference are used for
each step.
“Somebody in this class enjoys whale watching.
Every person who enjoys whale watching cares
about ocean pollution. Therefore, there is a
person in this class who cares about ocean
pollution.”
6
Question 3(solution)
✘ Let c(x) be "x is in this class," let w(x) be "x enjoys whale watching," and let p(x) be "x
cares about ocean pollution." We are given premises ⱻ x(c(x) ˄ w(x)) and
Ɐx(w(x)→p(x)), and we want to conclude ⱻx( c( x) ˄ p( x)) . In our proof, y represents
an unspecified particular person.
7
Question 4
8
Question 4(solution)
9
Question 5
✘ Prove the proposition P(0), where P(n) is the
proposition “If n is a positive integer greater
than 1, then n2 > n.”
✘ What kind of proof did you use?
10
Question 5(solution)
The proposition we are trying to prove is "If 0 is a
positive integer greater than 1, then 02 > 0 ." Our
proof is a vacuous one. Since the hypothesis is false,
the conditional statement is
automatically true.
11
Question 6
✘ Use a proof by contraposition to show that if x+ y ≥ 2,
where x and y are real numbers, then x ≥ 1 or y ≥ 1.
12
Question 6 (solution)
We will prove the contrapositive (that if it is not true that
x>=1 or y >=1, then it is not true that x + y ≥2), using a direct
argument.
Assume that it is not true that x≥1 or y≥1. Then (by De
Morgan's law) x < 1 and y < 1.
Adding these two inequalities, we obtain x + y < 2. This is
the negation of x + y ≥ 2, and our proof is complete.
13
Question 7
✘ Prove that if n is a positive integer, then n is odd if and
only if 5n + 6 is odd.
14
Question 7 (solution)
We must prove two conditional statements. First, we assume that n is odd and
show that 5n + 6 is odd (this is a direct proof).
By assumption, n = 2k + 1 for some integer k. Then 5n + 6=5(2k+1) + 6 = lOk + 11 =
2(5k + 5) + 1. Since we have written 5n + 6 as 2 times an integer plus 1, we have
showed that 5n + 6 is odd, as desired.
Now we give an proof by contraposition of the converse. Suppose that n is not
odd-in other words, that n is even. Then n = 2k for some integer k. Then 5n + 6 =
lOk + 6 = 2(5k + 3). Since we have written 5n + 6 as 2 times an integer, we have
showed that 5n + 6 is even. This completes the proof by contraposition of this
conditional statement.
15
THANKS!
Any questions?
16