Math 55: Discrete Mathematics

UC Berkeley, Fall 2011

Homework # 5, due Wednesday, February 22
5.1.4 Let P(n) be the statement that 1
3
+ 2
3
+ + n
3
= (n(n + 1)/2)
2
for
the positive integer n.
a) What is the statement P(1)?
b) Show that P(1) is true.
c) What is the induction hypothesis?
d) What do you need to prove in the inductive step?
e) Complete the inductive step.
f ) Explain why these steps show that this formula is true for all
positive integers n.
a) P(1) is the statement 1
3
= ((1(1 + 1)/2)
2
.
b) This is true because both sides of the equation evaluate to 1.
c) The induction hypothesis is the statement P(k) for some positive
integer k, that is, the statement 1
3
+2
3
+ +k
3
= (k(k+1)/2)
2
.
d) Assuming that P(k) holds, we need to show that P(k +1) holds,
that is, we need to derive the equation 1
3
+2
3
+ +k
3
+(k+1)
3
=
((k + 1)(k + 2)/2)
2
from the equation in (c).
e) We add (k + 1)
3
to both the left hand side and the right hand
side of the equation in (c). This shows that the left hand side
in (d) is equal to (k(k + 1)/2)
2
+ (k + 1)
3
. By expanding and
factoring, we nd that this expression equals ((k +1)(k +2)/2)
2
.
Hence we have shown that the left hand side of the equation in
(d) equals the right hand side of the equation in (d).
f) We have carried out both the basis step and the inductive step.
The principle of mathematical induction now ensures that P(n)
is true for all positive integers n.
1
5.1.6 Prove that 1 1! + 2 2! + + n n! = (n + 1)! 1 whenever n is a
positive integer.
We use mathematical induction. In fhe basis step, for n = 1, the
equation states that 1 1! = (1 +1)! 1, and this is true because both
sides of the equation evaluate to 1. For the inductive step, we assume
that 1 1! + 2 2! + +k k! = (k + 1)! 1 for some positive integer
k. We add (k + 1)(k + 1)! to the left hand side to nd that
1 1! + 2 2! + + (k + 1) (k + 1)! = (k + 1)! 1 + (k + 1)(k + 1)!
The right hand side equals (k + 1)!(k + 2) 1 = (k + 2)! 1. This
establishes the desired equation also for k +1, and we are done by the
principle of mathematical induction.
5.1.10 a) Find a formula for
1
1 2
+
1
2 3
+ +
1
n(n + 1)
by examining the values of this expression for small values of n.
b) Prove the formula you conjectured in part (a).
(a) By evaluating the sum for n = 1, 2, 3, 4, 5, . . ., we are led to conjec-
ture that the following equation holds for all positive integers n:
1
1 2
+
1
2 3
+ +
1
n(n + 1)
=
n
n + 1
. (1)
(b) We use mathematical induction. The basis step is n = 1. Here
both sides of the equation are equal to 1/2, so the claim holds.
For the inductive step, we assume that (1) is true for n = k. We
add
1
(k+1)(k+2)
to both sides of this equation. Then the right hand
side becomes
k
k + 1
+
1
(k + 1)(k + 2)
=
k(k + 2) + 1
(k + 1)(k + 2)
=
k + 1
k + 2
.
Hence the left hand side of (1) for n = k+1 equals the right hand
side of (1) for n = k + 1. This completes the proof by induction.
5.1.18 Prove that n! < n
n
for all integers n 2, using the six suggested steps.
Let P(n) be the propositional function n! < n
n
.
2
a) The statement P(2) says that 2! = 2 is less than 2
2
= 4.
b) This statement is true because 4 is larger than 2.
c) The inductive hypothesis states that P(k) holds for some integer
k 2.
d) We need to prove that k! < k
k
implies (k + 1)! < (k + 1)
k+1
.
e) Given that k! < k
k
holds, easily seen inequalities imply
(k +1)! = k! (k +1) < k
k
(k +1) < (k +1)
k
(k +1) = (k +1)
k+1
.
f) We have carried out both the basis step and the inductive step.
The principle of mathematical induction now ensures that P(n)
is true for all integers n 2.
5.1.32 Prove that 3 divides n
3
+ 2n whenever n is a positive integer.
We use mathematical induction. For n = 1, the assertion says that 3
divides 1
3
+2 1, which is indeed the case, so the basis step is ne. For
the inductive step, we assume that 3 divides k
3
+2k for some positive
integer k. Hence there exists an integer l such that 3l = k
3
+ 2k. A
computation shows
(k + 1)
3
+ 2(k + 1) = (k
3
+ 2k) + 3(k
2
+ k + 1).
The right hand is divisible by 3. This is evident for the second sum-
mand, and it is the induction hypothesis for the rst summand. Hence
we have proved that 3 divides (k + 1)
3
+ 2(k + 1). This complete the
inductive step, and hence the assertion follows.
5.1.54 Use mathematical induction to show that given a set of n + 1 positive
integers, none exceeding 2n, there is at least one integer in this set
that divides another integer in the set.
Let P(n) be the following propositional function: given a set of n + 1
positive integers, none exceeding 2n, there is at least one integer in
this set that divides another integer in the set. The proposition P(1)
is true because there is only one set of 1 + 1 positive integers none
exceeding 2 1. This set is {1, 2} and it contains an integer, namely 1,
that divides the other integer, namely 2. This veries the basis step
in our proof by mathematical induction.
For the inductive step we assume that P(k) is true for some positive
integer k. To prove P(k + 1), we consider a set S of k + 2 positive
3
integers none exceeding 2k +2. If S {2k +1, 2k +2} has cardinality
0 or 1 then we apply the induction hypothesis to S\{2k + 1, 2k + 2}
to conclude that this set contains a dividing pair of integers.
Hence we are left with the case that 2k + 1 and 2k + 2 are both in S
and S\{2k + 1, 2k + 2} consists of k positive integers of size at most
2k that pairwise dont divide each other. If k + 1 is in S then we are
done because k + 1 divides 2k + 2. Suppose therefore that k + 1 S.
Then we replace S by the set S

= (S\{2k + 2}) {k + 1}. The new

set S

is covered by the previous case, so it contains a divisible pair. If

that pair does not involve k +1 then it is also in S. If it involves k +1
then this means that some l S\{k + 1} divides l. That l must also
divide 2k + 2 and hence S contains a divisible pair. This completes
the inductive step and hence the proof.
5.2.4 Let P(n) be the statement that a postage of n cents can be formed
using just 4-cent stamps and 7-cent stamps. Prove that P(n) is true
for n 18, using the six suggested steps.
We prove this using strong induction. The basis step is to check that
P(18), P(19), P(20) and P(21) hold. This seen from the identities
18 = 4+7+7, 19 = 4+4+4+7, 20 = 4+4+4+4+4, 21 = 7+7+7.
For the inductive step, we assume that P(j) holds for all integers j
with 18 j k where k 21. To realize k + 1 cents, we rst realize
k 3 cents using 4-cent stamps and 7-cent stamps. This is possible by
the inductive hypothesis, since k 3 18. Now add one more 4-cent
stamp to realize k +1 cents. This completes the induction step and it
hence proves the assertion.
5.2.10 Assume that a chocolate bar consists of n squares arranged in a rect-
angular pattern. The entire bar, or a smaller rectangular piece of the
bar, can be broken along a vertical or a horizontal line separating the
squares. Assuming that only one piece can be broken at a time, de-
termine how many breaks you must successively make to break the bar
into n separate squares use strong induction to prove your answer.
We claim that the number of needed breaks is n 1. We shall prove
this for all positive integers n using strong induction. The basis step
n = 1 is clear. In that case we dont need to break the chocolate
at all, we can just eat it. Suppose now that n 2 and assume the
assertion is true for all rectangular chocolate bars with fewer than n
4
squares. Then we break the chocolate into two pieces of size m and
n m where 1 m < n. By the induction hypotheses, the bar
with m pieces requires m1 breaks and the bar with n m squares
requires n m 1 breaks. Thus the original cholocate bar requires
1+(m1)+(nm1) breaks. This number equals n1, as required.
5.2.26 Suppose that P(n) is a propositional function. Determine for which
nonnegative integers n the statement P(n) must be true if
a) P(0) is true; for all nonnegative integers n, if P(n) is true then
P(n + 2) is true.
b) P(0) is true; for all nonnegative integers n, if P(n) is true then
P(n + 3) is true.
c) P(0) and P(1) are true; for all non-negative integers n, if P(n)
and P(n + 1) are true then P(n + 2) is true.
d) P(0) is true; for all non-negative integers n, if P(n) is true then
P(n + 2) and P(n + 3) are true.
a) The statement P(n) is true for all nonnegative integers n that
are even.
b) The statement P(n) is true for all nonnegative integers n that
are divisible by 3.
c) The statement P(n) is true for all nonnegative integers n.
d) The statement P(n) is true for all nonnegative integers n with
n = 1, since every such n is expressible as a sum of 2s and 3s.
5.3.4 Find f(2), f(3), f(4), and f(5) if f is dened recursively by f(0) =
f(1) = 1 and for n = 1, 2, . . .
a) f(n + 1) = f(n) f(n 1),
b) f(n + 1) = f(n)f(n 1),
c) f(n + 1) = f(n)
2
+ f(n 1)
2
,
d) f(n + 1) = f(n)/f(n 1).
a) 0, 1, 2, 3
b) 1, 1, 1, 1
c) 2, 5, 29, 866
d) 1, 1, 1, 1
5
5.3.6 Determine whether each of these proposed denitions is a valid recur-
sive denition of a function f from the set of all nonnegative integers
to the set of integers. If f is well dened, nd a formula for f(n) when
n is a nonnegative integer and prove that your formula is valid.
a) f(0) = 1, f(n) = f(n 1) for n 1,
b) f(0) = 1, f(1) = 0, f(2) = 2, f(n) = 2f(n 3) for n 3,
c) f(0) = 0, f(1) = 1, f(n) = 2f(n + 1) for n 2,
d) f(0) = 0, f(1) = 1, f(n) = 2f(n 1) for n 1,
e) f(0) = 2, f(n) = f(n 1) if n is odd and n 1 and f(n) =
2f(n 2) if n 2.
a) The function is well-dened and given by f(n) = (1)
n
.
b) The function is well-dened and given by f(n) = 0 if n 1 (mod3)
and f(n) = 2
(n1)/2
otherwise.
c) The function is not well-dened because the denition of f(n)
involves the value at n + 1.
d) The function is well-dened and given by f(n) = 2
(n+3)/2
.
5.3.8 Give a recursive denition of the sequence [a
n
], n = 1, 2, 3, . . . if
a) a
n
= 6n,
b) a
n
= 2n + 1,
c) a
n
= 10
n
,
d) a
n
= 5.
a) a
1
= 6 and a
n
= a
n1
+ 6 for n 2.
b) a
1
= 3 and a
n
= a
n1
+ 2 for n 2.
c) a
1
= 1 and a
n
= 10a
n1
for n 2.
d) a
1
= 5 and a
n
= a
n1
for n 2.
5.3.12 Let f
n
denote the nth Fibonacci number. Prove that f
2
1
+f
2
2
+ +f
2
n
=
f
n
f
n+1
when n is a positive integer.
We prove this by induction on n. The statement is true for n = 1
because 1
2
= 1 1, it is true for n = 2 because 1
2
+ 1
2
= 1 2, and it
is true for n = 3 because 1
2
+ 1
2
+ 2
2
= 2 3. This takes care of the
6
basis step. For the inductive step, suppose it is true for n = k, and
consider the left hand for n = k + 1. We nd
f
2
1
+ f
2
2
+ + f
2
k
+ f
2
k+1
= f
k
f
k+1
+ f
2
k+1
= f
k+1
(f
k
+ f
k+1
).
The last expression equals f
k+1
f
k+2
by the recursive denition of the
Fibonacci sequences. The veries the equation for n = k +1. We have
thus completed both the basis step and the inductive step, and hence
the claim follows by the principle of mathematical induction.
5.3.20** Give a recursive denition of the functions max and min, so that that
max(a
1
, a
2
, . . . , a
n
) and min(a
1
, a
2
, . . . , a
n
) are the maximum and the
minimum of the n numbers a
1
, a
2
, . . . , a
n
respectively.
max(a
1
, . . . , a
n
) =

a
1
if n = 1 (base case)
a
n
if n > 1 and
a
n
> max(a
1
, . . . , a
n1
)
max(a
1
, . . . , a
n1
) otherwise
min(a
1
, . . . , a
n
) =

a
1
if n = 1 (base case)
a
n
if n > 1 and
a
n
< min(a
1
, . . . , a
n1
)
min(a
1
, . . . , a
n1
) otherwise
5.3.51 Find these values of Ackermanns function
a) A(2, 3)
b) A(3, 3)
The Ackermann function is dened recursively by
A(m, n) = 2n if m = 0;
A(m, n) = 0 if m 1 and n = 0;
A(m, n) = 2 if m 1 and n = 1;
A(m, n) = A(m1, A(m, n1)) if m 1 and n 2.
We have A(2, 2) = A(1, A(2, 1)) = A(1, 2) = A(0, A(1, 1)) = A(0, 2) =
4. Also, we have A(1, 1) = 2, A(1, 2) = A(0, A(1, 1)) = A(0, 2) = 4,
A(1, 3) = A(0, A(1, 2)) = A(0, 4) = 8, and A(1, 4) = A(0, A(1, 3)) =
A(0, 8) = 16. More generally, A(1, n) = 2
n
. This is Exercise 50.
7
a) A(2, 3) = A(1, A(2, 2)) = A(1, 4) = 16.
b) A(3, 3) = A(2, A(3, 2)) = A(2, A(1, A(3, 1))) = A(2, A(1, 2)) =
A(2, 4) = A(1, A(2, 3)) = A(1, 16) = 2
16
= 65536.
8