Scribd
Upload
3 views

t10

The document is a tutorial on mathematical induction, providing proofs for three different statements. It demonstrates how to use induction to prove that the sum of a series equals a specific formula, the binomial coefficient identity, and that the number of subsets of an n-element set is 2^n. Each proof includes a base case, an inductive hypothesis, and an inductive step to validate the conclusions.

Uploaded by

王少甫
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

t10

The document is a tutorial on mathematical induction, providing proofs for three different statements. It demonstrates how to use induction to prove that the sum of a series equals a specific formula, the binomial coefficient identity, and that the number of subsets of an n-element set is 2^n. Each proof includes a base case, an inductive hypothesis, and an inductive step to validate the conclusions.

Uploaded by

王少甫
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Tutorial 10: Induction

Department of Computer Science and Engineering


Hong Kong University of Science and Technology

Tutorial 10: Induction 1/8


Question 1

Use induction to prove that

n(n + 1)(n + 2)
1 · 2 + 2 · 3 + · · · + n(n + 1) =
3
for all integers n ≥ 1
Solution:
Denote the statement to be proven by p(n).
- Base case:
For n = 1, we have 1 · 2 = 1 · 2 · 3/3. So p(1) is true.
- Inductive hypothesis:
Suppose p(n − 1) is true for some n ≥ 2, i.e.

(n − 1)n(n + 1)
1 · 2 + 2 · 3 + · · · + (n − 1)n = .
3

Tutorial 10: Induction 2/8


Question 1
- Inductive step:
Adding n(n + 1) to both sides of p(n − 1), gives
1 · 2 + 2 · 3 + · · · + (n − 1)n + n(n + 1)
(n − 1)n(n + 1)
= + n(n + 1)
3
(n − 1)n(n + 1) + 3n(n + 1)
=
3
n(n + 1)((n − 1) + 3) n(n + 1)(n + 2)
= =
3 3
which shows that p(n) is true. Thus p(n − 1) → p(n).
- Inductive conclusion:
By the principle of mathematical induction, we can conclude
that
n(n + 1)(n + 2)
1 · 2 + 2 · 3 + · · · + n(n + 1) =
3
is true for all integers n ≥ 1.
Tutorial 10: Induction 3/8
Question 2

Let 0 ≤ j ≤ n, prove that


n    
X i n+1
= .
j j +1
i=j

Solution:
- Base case:
0 1
 
For n = 0, the equation says 0 = 1 , so p(0) is true.
- Inductive hypothesis:
Suppose for n = k − 1 ≥ 0, the equation is true.

Tutorial 10: Induction 4/8


Question 2

- Inductive step:
For the inductive hypothesis (second equality) and the Pascal
relationship (third equality), we have
k   k−1          
X i X i k k k k +1
= + = + = .
j j j j +1 j j +1
i=j i=j

Thus the equation is true for n = k, i.e. p(n − 1) → p(n).


- Inductive conclusion:
From the principle of mathematical induction, the equation is
true for all integers n ≥ 0.

Tutorial 10: Induction 5/8


Question 3

Prove by induction that the number of subsets of an n-element set


is 2n for all n ≥ 0.
Solution:
Denote the statement to be proven by p(n).
- Base case:
For n = 0, the set has no elements, so it is the empty set.
The only subset of the empty set is the empty set. Since
20 = 1, p(0) is true.
- Inductive hypothesis:
Assume p(n − 1) is true for some n ≥ 1, i.e., the number of
subsets of an (n − 1)-element set is 2n−1 .

Tutorial 10: Induction 6/8


Question 3

- Inductive step:
For any set S of size n ≥ 1, identify a single element x ∈ S.
The subsets of S can be partitioned into (i) those subsets that
do not contain x and (ii) those subsets that do contain x.
The number of subsets not containing x is the number of
subsets of S − {x}, which, by the inductive hypotheses, is
2n−1 .
The number of subsets containing x must be the same,
because by removing x from each we get a subset not
containing x.
Thus, the total number of subsets is 2n−1 + 2n−1 = 2n .
- Inductive conclusion:
By the principle of mathematical induction, the number of
subsets of an n-element set is 2n for all n ≥ 0.
Tutorial 10: Induction 7/8
Question 3

Comment: In class we prove something very similar, when using a


recurrence relation method to solve this problem.
First we used the same type of idea and induction to prove that
S(n), the number of subsets of an n item set, satisfies

S(0) = 1; S(n) = 2S(n − 1) for n > 1

Then we used induction AGAIN to prove that such an S(n)


satisfies S(n) = 2n
So, in class, we actually used induction twice.
Here, we combined the two steps into one.

Tutorial 10: Induction 8/8

You might also like