Académique Documents
Professionnel Documents
Culture Documents
P(0) is true
and
Then
P(0) is true
If it starts...
and
Then
If it starts... going...
and
Then
If it starts... going...
and
P(0) is true
and
Then
0=0
0+1=1
0+1+2=3
0+1+2+3=6
0 + 1 + 2 + 3 + 4 = 10
0 + 1 + 2 + 3 + 4 + 5 = 15
1 + 2 + … + (n – 1) + n = n(n+1) / 2
n+1
Some Sums
0=0
0+1=1
0+1+2=3
0+1+2+3=6
0 + 1 + 2 + 3 + 4 = 10
0 + 1 + 2 + 3 + 4 + 5 = 15
Some Sums
0 = 0 = 0(0 + 1) / 2
0 + 1 = 1 = 1(1 + 1) / 2
0 + 1 + 2 = 3 = 2(2 + 1) / 2
0 + 1 + 2 + 3 = 6 = 3(3 + 1) / 2
0 + 1 + 2 + 3 + 4 = 10 = 4(4 + 1) / 2
0 + 1 + 2 + 3 + 4 + 5 = 15 = 5(5 + 1) / 2
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
theAlways
first zeromention
positive that
natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
you're
Forplanning
the inductive step, assume
on doing that for some n, P(n) holds, so
the proof
1 + 2by+ … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
induction, just as you
meaning that the sum of the first n + 1 natural numbers is
(n +would by contradiction
1)(n + 2)/2. or of the first n + 1 positive natural
Consider the sum
numbers. contrapositive.
This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
Explicitly
meaning that the state
sum of the first n +what property
1 natural numbers is
you're
(n + 1)(n + 2)/2. trying
Consider the sumto show
of the first for all
n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
thehypothesis,
n + 1. By the inductive natural this numbers.
is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By theState what
inductive you're this
hypothesis, trying to by
is given prove for P(0),
then go and prove it. You can use any
proof technique you'd like.
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the In this step,
inductive we this
hypothesis, need to prove
is given by
“For any natural number n, P(n) → P(n + 1)”
To prove this, we choose an arbitrary n, then
Thus P(n + 1) holds whenassume P(n).
P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
n( n+1) n(n+1)+2(n+1) (n+1)(n+2)
1+...+n+n+1= +n+1= =
2 2 2
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
n( n+1) n(n+1)+2(n+1) (n+1)(n+2)
1+...+n+n+1= +n+1= =
2 2 2
The inductive hypothesis is that P(n) is
Thus P(n + 1) holds when P(n) is true,
true. sowhy
It's P(n)we
is true
can for
use all
thenatural
result for n
numbers n. ■
to simplify this sum.
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
n( n+1) n(n+1)+2(n+1) (n+1)(n+2)
1+...+n+n+1= +n+1= =
2 2 2
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
n( n+1) n(n+1)+2(n+1) (n+1)(n+2)
1+...+n+n+1= +n+1= =
2 2 2
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Our First Proof By Induction
Theorem: The sum of the first n positive natural numbers is n(n + 1)/2.
Proof: By induction. Let P(n) be “the sum of the first n positive natural
numbers is n(n + 1) / 2.” We show that P(n) is true for all natural
numbers n.
For our base case, we need to show P(0) is true, meaning that the sum
of the first zero positive natural numbers is 0(0 + 1)/2. Since the sum of
the first zero positive natural numbers is 0 = 0(0 + 1)/2, P(0) is true.
For the inductive step, assume that for some n, P(n) holds, so
1 + 2 + … + n = n(n + 1) / 2. We need to show that P(n + 1) holds,
meaning that the sum of the first n + 1 natural numbers is
(n + 1)(n + 2)/2. Consider the sum of the first n + 1 positive natural
numbers. This is the sum of the first n positive natural numbers, plus
n + 1. By the inductive hypothesis, this is given by
n( n+1) n(n+1)+2(n+1) (n+1)(n+2)
1+...+n+n+1= +n+1= =
2 2 2
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural
numbers n. ■
Structuring a Proof by Induction
● State that you are attempting to prove something by induction.
● State what your choice of P(n) is.
● Prove the base case:
● State what P(0) is, then prove it.
● Prove the inductive step:
● State that you're assuming P(n) and what P(n) is.
● State what P(n + 1) is. (this is what you're trying to prove)
● Go prove P(n + 1)
● This is very rigorous, so as we gain more familiarity with
induction we will start being less formal in our proofs.
Notation: Summations
● Instead of writing 1 + 2 + 3 + … + n, we write
∑i
i=0
Notation: Summations
● Instead of writing 1 + 2 + 3 + … + n, we write
Sum from i = 0
n
∑i
i=0
Notation: Summations
● Instead of writing 1 + 2 + 3 + … + n, we write
Sum from i = 0 to n
n
∑i
i=0
Notation: Summations
● Instead of writing 1 + 2 + 3 + … + n, we write
Sum from i = 0 to n
n
∑i of i
i=0
Summation Examples
5
∑ i=1+2+3+4+5=15
i=1
3
∑ i =1 +2 +3 =1+4+9=14
2 2 2 2
i=1
i=0
The Empty Sum
● A sum of no numbers is defined to be zero.
● Examples:
0 42 −1
∑ 2 =0i
∑ i =0 i
∑ i=0
i=1 i=137 i=0
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i=0= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i=0= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that Pro tip – When proving
n+1 n
n(n+1) n(n+1)+2(n+1)
properties of (n+1)(n+2)
sums with
∑ i=∑ i+( n+1)= 2 +n+1= =
i=1 i=1 induction,2 it often helps 2to “peel
Thus P(n + 1) holds when P(n) is true, so P(n) off”
is truethe
for all
lastnatural
few numbers
terms. n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
n
n(n+1)
Theorem: For any natural number n, ∑ i=
i=1 2
Proof: By induction. Let P(n) be
n
n(n+1)
P(n) ≡ ∑ i=
i=1 2
For our base case, we need to show P(0) is true, meaning that
0
0(0+1)
∑ i= 2
i=1
This is trivial, since the empty sum is defined to be zero.
For the inductive step, assume that for some n, P(n) holds, so
n
n(n+1)
∑ i= 2
i=1
We need to show that P(n + 1) holds, meaning that
n+1
(n+1)(n+2)
∑ i= 2
i=1
To see this, note that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
Thus P(n + 1) holds when P(n) is true, so P(n) is true for all natural numbers n. ■
An Incorrect Proof
n 2
1 1
Theorem: For any natural number n, ∑ i= ( n+ )
i=1 2 2
n 2
1 1
Proof: Let P(n) be P(n) ≡ ∑ i= ( n+ )
i=1 2 2
Now, assume that for some n, P(n) holds, so
n 2
1 1
∑ 2 2)
i= ( n+
i=1
We want to show that P(n + 1) is true, which means that we want to show
n+1 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9
n +n+ +2n+2 n +3n+ 2
4 4 (n+3/ 2)
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9
n +n+ +2n+2 n +3n+ 2
4 4 (n+3/ 2)
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9
n +n+ +2n+2 n +3n+ 2
4 4 (n+3/ 2)
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9
n +n+ +2n+2 n +3n+ 2
4 4 (n+3/ 2)
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9
n +n+ +2n+2 n +3n+ 2
4 4 (n+3/ 2)
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9 3 2
n +n+ +2n+2 n +3n+ (n+ )
4 4 2
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9 3 2
n +n+ +2n+2 n +3n+ (n+ )
4 4 2
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9 3 2
n +n+ +2n+2 n +3n+ (n+ )
4 4 2
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9 3 2
n +n+ +2n+2 n +3n+ (n+ )
4 4 2
= = =
2 2 2
∑ i= 12 ( n+1+ 12 ) = 12 (n+ 32 )
i=1
To see this, note that
1 2 1 2
n+1 n 2 (n+ ) ( n+ ) +2( n+1)
1 1 2 2(n+1) 2
∑ ∑ i= i+n+1=
2
(n+
2
) +n+1=
2
+
2
=
2
i=1 i=1
2 1 2 9
n +n+ +2n+2 n +3n+ 2
4 4 (n+3/ 2)
= = =
2 2 2
“Once he gets
a momentum,
nothing can stop
him”
- X Men 3
Stopping the Juggernaut
“Once he gets
a momentum,
nothing can stop
him”
- X Men 3
P(n) → P(n + 1)
is not enough!
Sums of Powers of Two
20 = 1 = 1
20 + 2 1 = 1 + 2 = 3
2 0 + 2 1 + 22 = 1 + 2 + 4 = 7
20 + 21 + 22 + 23 = 1 + 2 + 4 + 8 = 15
Sums of Powers of Two
20 = 1 = 1 = 2 1 – 1
20 + 2 1 = 1 + 2 = 3 = 22 – 1
2 0 + 2 1 + 22 = 1 + 2 + 4 = 7 = 2 3 – 1
20 + 21 + 22 + 23 = 1 + 2 + 4 + 8 = 15 = 24 – 1
Sums of Powers of Two
20 = 1 = 1 = 2 1 – 1
20 + 2 1 = 1 + 2 = 3 = 22 – 1
2 0 + 2 1 + 22 = 1 + 2 + 4 = 7 = 2 3 – 1
20 + 21 + 22 + 23 = 1 + 2 + 4 + 8 = 15 = 24 – 1
n
∑ 2 =2 i n+1
−1
i=0
n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
P(n) ≡ ∑ 2i =2n+1−1
i=0
For our base case, we need to show P(0) is true, meaning that
0
∑ 2i =21−1
i=0
Since 20 = 1 = 21 – 1, this is true.
For the inductive step, assume that for some n, P(n) holds, so
n
∑ 2 =2i n+1
−1
i=0
We need to show that P(n + 1) holds, meaning that
n+1
∑ 2i =2n+2−1
i=0
To see this, note that
n+1 n
3
Finding the Counterfeit Coin
1 2
3
Finding the Counterfeit Coin
3
Finding the Counterfeit Coin
3
Finding the Counterfeit Coin
3
Finding the Counterfeit Coin
3
Finding the Counterfeit Coin
1 2
3
Finding the Counterfeit Coin
1 2
3
A Harder Problem
● You are given a set of nine seemingly identical
coins, eight of which are real and one of which
is counterfeit.
● The counterfeit coin weighs more than the rest
of the coins.
● You are given a balance. Using only two
weighings on the balance, find the counterfeit
coin.
Finding the Counterfeit Coin
1 2 3
4 5 6
7 8 9
Finding the Counterfeit Coin
1 2 3 4 5 6
7 8 9
Finding the Counterfeit Coin
6
5
4
3
2
1
7 8 9
Finding the Counterfeit Coin
6
5
4
3
2
1
7 8 9
Finding the Counterfeit Coin
6
5
4
3
2
1
7 8 9
1
2
3
4
5
7 8 9 6
Finding the Counterfeit Coin
1
2
3
4
5
7 8 9 6
Finding the Counterfeit Coin
1
2
3
4
5
7 8 9 6
1 2 3 4 5 6
7 8 9
Finding the Counterfeit Coin
1 2 3 4 5 6
7 8 9
Finding the Counterfeit Coin
1 2 3 4 5 6
7 8 9
1, 3, 9 = 30, 31, 32
● Pulitzer-Prize winning
book exploring
recursion, computability,
and consciousness.
● Written by Douglas
Hofstadter, computer
scientist at Indiana
University.
● A great (but dense!)
read.
The MU Puzzle
● Begin with the string MI.
● Repeatedly apply one of the following operations:
● Double the contents of the string after the M: for example,
MIIU becomes MIIUIIU or MI becomes MII.
● Replace III with U: MIIII becomes MUI or MIU
● Append U to the string if it ends in I: MI becomes MIU
● Remove any UU: MUUU becomes MU
● Question: How do you transform MI to MU?
A) Double the contents
of the string after M.
B) Replace III with U.
C) Remove UU
D) Append U if the
string ends in I.
MI
MII 2
MIIII 4
MIIIIU 4
MIIIIUIIIIU 8
MIIIIUUIU 5
MIIIIUUIUIIIIUUIU 10
MUIUUIUIIIIUUIU 7
Counting I's
MI 1
MII 2
MIIII 4
None of
these are
MIIIIU 4 multiples of
three...
MIIIIUIIIIU 8
MIIIIUUIU 5
MIIIIUUIUIIIIUUIU 10
MUIUUIUIIIIUUIU 7
The Key Insight
● Initially, the number of I's is not a multiple of
three.
● To make MU, the number of I's must end up as
a multiple of three.
● Can we ever make the number of I's a multiple
of three?
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Lemma: After beginning with MI and applying any legal sequence of the specified
rules, the number of I's never becomes a multiple of three.
Proof: By induction. Let P(n) be “After making n legal moves after starting with MI,
the number of I's is not a multiple of 3.” We prove that P(n) holds for all natural
numbers n.
As a base case, to prove that P(0) is true, we need to show that after making no
moves the number of I's is not a multiple of 3. MI has one I in it, which is not a
multiple of 3.
For the inductive step, assume that P(n) holds and that after any sequence of n
operations, the number of I's is not a multiple of 3. To prove that P(n + 1) holds (that
after n + 1 operations the number of I's is not a multiple of 3), we note by the
inductive hypothesis that after the first n operations, the number of I's is not a
multiple of 3. Since it is not a multiple of 3, it must either have the form 3k + 1 or
3k + 2 for some k. Consider the (n + 1)st operation:
- If it's “double the string after the M,” then we either end up with 2(3k + 1) = 6k + 2 =
3(2k) + 2 or 2(3k + 2) = 6k + 4 = 3(2k + 1) + 1 I's, neither of which is a multiple of 3.
- If it's “delete UU” or “append U,” the number of I's is unchanged.
- If it's “delete III,” then we either go from 3k + 1 to 3k + 1 – 3 = 3(k – 1) + 1 or from
3k + 2 to 3k + 2 – 3 = 3(k – 1) + 2 I's, neither of which is a multiple of 3.
Thus any sequence of n + 1 legal operations starting with MI ends with the number
of I's not a multiple of three, so P(n + 1) holds. ■
Theorem: The MU puzzle has no solution.
For the inductive step, assume that for some n the theorem is true. Then we
have that
n+1 n
n(n+1) n(n+1)+2(n+1) (n+1)(n+2)
∑ i=∑ i+( n+1)= 2 +n+1= 2
=
2
i=1 i=1
so the theorem is true for n + 1, completing the induction. ■
A Variant of Induction
n versus 2
2 n
● 02 = 0 ● 20 = 1
● 12 = 1 ● 21 = 2
● 22 = 4 ● 22 = 4
● 32 = 9 ● 23 = 8
● 42 = 16 ● 24 = 16
● 52 = 25 ● 25 = 32
● 62 = 36 ● 26 = 64
● 72 = 49 ● 27 = 128
● 82 = 64 ● 28 = 256
● 92 = 81 ● 29 = 512
● 102 = 100 ● 210 = 1024
n versus 2
2 n
● 02 = 0 < ● 20 = 1
● 12 = 1 < ● 21 = 2
● 22 = 4 = ● 22 = 4
● 32 = 9 > ● 23 = 8
● 42 = 16 = ● 24 = 16
● 52 = 25 < ● 25 = 32
● 62 = 36 < ● 26 = 64
● 72 = 49 < ● 27 = 128
● 82 = 64 < ● 28 = 256
● 92 = 81 < ● 29 = 512
● 102 = 100 < ● 210 = 1024
n versus 2
2 n
2n is much
02 = 0 < 20 = 1
bigger here.
● ●
● 12 = 1 < ● 21 = 2
Does the trend
● 22 = 4 = ● 22 = 4
continue?
● 3 =9
2
> ● 2 =8
3
● 42 = 16 = ● 24 = 16
● 52 = 25 < ● 25 = 32
● 62 = 36 < ● 26 = 64
● 72 = 49 < ● 27 = 128
● 82 = 64 < ● 28 = 256
● 92 = 81 < ● 29 = 512
● 102 = 100 < ● 210 = 1024
Theorem: For any natural number n ≥ 5, n2 < 2n.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1
< n2 + 2n + n (since 1 < 5 ≤ n)
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.
(n + 1)2 = n2 + 2n + 1
Since n ≥ 5,
(n + 1)2 = n2 + 2n + 1 Why
Why isis this
this
< n2 + 2n + n allowed?
(since 1 < 5 ≤ n)
allowed?
= n2 + 3n
< n2 + n 2 (since 3n < 5n ≤ n2)
= 2n2.