NICHOLAS OMONDI.

COSC 522.
9/29/2014
HOMEWORK #2. 2.1-2.2.
1. Providing counter examples.
a) A whale is an animal that lives in the sea that is not a fish, so this is a
counterexample to : All animals living in the ocean are Fish.
b) 1,2,3,4, are all counterexamples of integers less than five , so this disproves the
statement : Every integer less than Ten is greater than five.
2. Proof by exhaustion and of example.
a) The square of the integer in the table clearly shows it is less than the sum of (10+5n).
n

10 +5n
1 1 15
2 4 20
3 9 25
4 16 30
5 25 35
b)
To disprove the statement: for any positive integer , the square of the integer is less than
or equal to the sum of 10 plus five times the integer, simply provide an example of a
positive integer which contradicts the statement. An example is 7 ,

= 49 and
49 () .
3. Give a direct proof to if an integer is divisible by 6, then twice that integer is divisible by
4.
If an integer is divisible by 6 then , x = 6k a multiple of 6.
Twice the integer is 2(6k) = 12k
Then showing that 12k is a multiple of 4: 12k = 4(3k).

4. Contrapositive of the statements in practice problem #5 in chapter 1.
a) If the river will not flood, then the rain will not continue.
b) If there is not a network failure, then the central switch does not go down.
c) If the avocadoes are neither dark nor soft, then they are not ripe.
d) If the diet is not good, then the cat is not healthy.

5. The converse of the statements in practice problem #5 in chapter 1.
a) If the river will flood, then it will continue to rain.
b) If there is network failure, then the central switch goes down.
c) If the Avocadoes are dark or soft, then they are ripe.
d) If the diet is good, then the cat is healthy.

6. Prove by contradiction that the product of odd integers is not even.
Let x = 2m + 1
y = 2n + 1
assume that the product xy is even which means xy = 2k for some integer k.

xy = (2m +1)(2n + 1) = 4mn + 2m + 2n + 1 = 2k

putting like terms together and factoring out 2 we get

1 = 2( k 2mn m n ) where k- 2mn- m- n is an integer.

The contradiction lies on the fact that 1 is not even , and therefore by contradiction the
product of odd integers is not even.

7. Proof by induction

1 + 2 + 3 + + n =
()

The basis step P(1)

1= 1(1+1)/2 = 1

Assume p(k)
1 + 2 + 3 + + k=
()

Prove ( k + 1 )

1 + 2 + 3 + + (k+1) =
()(())

?

1 + 2 + 3 + . + (k + 1) = 1 + 2 + 3 + ..+ k + (k+1)

=
()

+ (k+1) = ( k+1)(

)

= ( k +1)(
()

) =
()()

8. Prove that

The base case is n = 2.

which is true.
Assume p(k)

Show p(k+1)

?



= (

)
(

) by the inductive step.

(

) since 2<3.

9.
a) Steps p(9) and p(10) are proved separately to verify p (k+1) implication 2` which is
done by subtracting 3 from k +1 , then for the inductive hypothesis to hold
( ) so k + 1 Therefore since implication 2` cannot be used to
verify both p(9) and P(10) so they have to be done separately.

b) The first principle of induction cannot be used because the truth value of P(k+1)
cannot be verified from the truth of p(k).