CS 381 SOLUTIONS TO HOMEWORK 5
Fall 2010
p. 49
46. If A is true then LHS is true. Since
is true for every x if A is true, RHS is also true.
If A is false then LHS is
.
Since
is P(x) if A is false, RHS is
.
Thus LHS and RHS always take the same value. Hence they are equivalent.
p. 62
38 a) At least one student in this class does not like
mathematics.
c) Every student in this class has not taken at least one mathematics
course offered at this school.
pp. 73 - 74
14 a)
------------------------
-- Universal Instantiation
------------------------
-- Modus Ponens
------------------------
-- Existential Generalization
c)
------------------------
-- Existential Instantiation
------------------------
-- Simplification
------------------------
-- Universal Instantiation
------------------------
-- Modus Ponens
Also
------------------------
-- Simplification
Hence
------------------------
-- Existential Generalization
20 a) No. It is not valid. The second sentence is the converse of the first
sentence with a substituted for x and it is not true.
b) Yes, it is valid.
p.85
16. Proof by contradiction, that is we assume that the conclusion (m is even or
n is even) is not true and try to derive a contradiction - a statement which is
always false.
Suppose the conclusion is not true that is neither m nor n is even.
Since m and n are odd then, there are integers k and l such that m = 2k + 1 and
n = 2l + 1.
Then mn = (2k+1)(2l+1) = 4kl + 2k + 2l + 1.
Since 4kl, 2k and 2l are even, 4kl+2k+2l+1 is odd, that is mn is odd which
contradicts the hypothesis that mn is even.
Thus our assumption is wrong and either m or n must be even.