lecture 3: method of inductionbbm205/lectures/lecture3.pdf · into two groups: those smaller than x...
TRANSCRIPT
![Page 1: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/1.jpg)
BBM 205 Discrete MathematicsHacettepe University
http://web.cs.hacettepe.edu.tr/∼bbm205
Lecture 3: Method of Induction
Lecturer: Lale Özkahya
Resources:http://www.eecs70.org
cs.colostate.edu/ cs122/.Spring15/home_resources.phphttp://www.cs.nthu.edu.tw/ wkhon/math16.html
![Page 2: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/2.jpg)
Introduction
• What is the formula of the sum of the first n positive odd integers?
1 = 1
1 + 3 = 4
1 + 3 + 5 = 9
1 + 3 + 5 + 7 = 16
1 + 3 + 5 + 7 + 9 = 25
3
![Page 3: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/3.jpg)
Introduction
• It is reasonable to guess that the sum is n2
• To do so, we may use a method, called mathematical induction, to prove that the guess is correct
• How to do that ?
4
![Page 4: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/4.jpg)
Mathematical Induction
• Firstly, to simplify the discussion, we define a propositional function P(n), where
P(n) := “The sum of first n positive odd integers is n2”
so that our target is to show n P(n) is true
5
![Page 5: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/5.jpg)
Mathematical Induction
• Next, we are going to show the following two statements to be true:
1. P(1), called basic step
2. n (P(n) P(n+1)), called inductive step, where domain of n is all positive integers
• If both can be shown true, then we can conclude that n P(n) is true [why?]
6
![Page 6: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/6.jpg)
Back to the Example
• We let
P(n) := “The sum of first n positive odd integers is n2”
and we hope to use mathematical induction to show n P(n) is true
• Can we show the basic step to be true?
• Can we show the inductive step to be true?
9
![Page 7: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/7.jpg)
Back to the Example
• Can we show the basic step to be true?
• The basic step is P(1), which is :
P(1) := “The sum of first 1 positive odd integers is 12”
This is obviously true.
10
![Page 8: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/8.jpg)
Back to the Example
• Can we show the inductive step to be true?
• The inductive step is n (P(n) P(n+1))
• To show it is true, we focus on an arbitrary chosen k, and see if P(k) P(k+1) is true
– If so, by universal generalization,
n (P(n) P(n+1)) is true
11
![Page 9: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/9.jpg)
Back to the Example
• Suppose that P(k) is true. That is,
P(k) := “The sum of first k positive odd integers is k2”
This implies 1 + 3 + … + (2k – 1) = k2.
Then, we have
1 + 3 + … + (2k – 1) + (2k + 1) = k2 + (2k + 1)
= (k + 1)2,
so that P(k+1) is true if P(k) is true. 12
![Page 10: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/10.jpg)
Remark
• Note : When we show that the inductive step is true, we do not show P(k+1) is true.
Instead, we show the conditional statement
P(k) P(k+1) is true.
This allows us to use P(k) as the premise, and gives us an easier way to show P(k+1)
• Once basic step and inductive step are proven, by mathematical induction, n P(n) is true
13
![Page 11: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/11.jpg)
Remark
• Mathematical induction is a very powerful technique, because we show just two statements, but this can imply infinite number of cases to be correct
• However, the technique does not help us find new theorems. In fact, we have to obtain the theorem (by guessing) in the first place, and induction is then used to formally confirm the theorem is correct
14
![Page 12: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/12.jpg)
More Examples
• Ex 1: Show that for all positive integer n,
n 2n
• Ex 2: Show that for all positive integer n,
n3 – n is divisible by 3
• Ex 3: Show that for all positive integer n,
12 + 22 + 32 + … + n2 = n(n+1)(2n+1) / 6
15
![Page 13: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/13.jpg)
Using a Different Basic Step
• When we apply the induction technique, it is not necessary to have P(1) as the basic step
• We may replace the basic step by P(k) for some fixed k. If both basic step and inductive step are true, this will imply that
n k (P(n))
16
![Page 14: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/14.jpg)
More Examples
• Ex 4: Show that for all positive integer n 4,
2n n!
• Ex 5: Show that for all non-negative integer n,
1 + 2 + … + 2n = 2n+1 – 1
• Ex 6: Show that for non-negative integer n,
7n+2 + 82n+1 is divisible by 57
17
![Page 15: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/15.jpg)
Interesting Examples
Snowball Fight
18
• There are 2n + 1 people
• Each must throw to the nearest
• All with distinct distance apart
• Show that at least one is not hit by any snowball
![Page 16: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/16.jpg)
Interesting Examples
Tiling (Again!)
19
• A big square of size 2n 2n
• Somewhere inside, a 1 1 small square is removed
• Show that the remaining board can always be tiled by L-shaped dominoes :
each consists of three 1 1 squares
![Page 17: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/17.jpg)
Strong Induction
• An alternative form of induction, called strong induction, uses a different inductive step:
n ( (P(1) P(2) P(n)) P(n+1) )
• The basic step is still to prove P(1) to be true
• Again, if both the basic and inductive steps are true, then we can conclude that n P(n) is true [how?]
20
![Page 18: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/18.jpg)
Examples
• Ex 1:
Define the nth Fibonacci number, Fn , as follows:
F0 = 1, F1 = 1,
Fn = Fn-1 + Fn-2, when n 2
By the above recursive definition, we get the first few Fibonacci numbers :
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …
21
![Page 19: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/19.jpg)
Examples
• Ex 1 (continued):
Show that Fn can be computed by the formula
Fn =
22
1
5 ( )
1 + 5 2
n –
1
5 ( )
1 – 5 2
n
![Page 20: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/20.jpg)
Examples
• Ex 2: Quicksort is a recursive algorithm for sorting a collection of distinct numbers :
1. If there is at most 1 number to sort, done
2. Else, pick any number x from the collection, and use x to divide the remaining numbers into two groups:
those smaller than x, those larger than x.
Next, apply Quicksort to sort each group
(putting x in-between afterwards) 23
![Page 21: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/21.jpg)
Examples
• For instance, suppose the input collection of numbers contains 1, 4, 3, 10, 7, 2
• First round, say we pick x = 3
• Then we will form two groups S and L:
S = { 1, 2 } and L = { 4, 10, 7 }
• After that, we apply Quicksort on each group, and in the end, we report
Quicksort(S), x, Quicksort(L)
24
![Page 22: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/22.jpg)
Examples
• Ex 2 (continued):
Show that Quicksort can correctly sort any collection of n distinct numbers
25
![Page 23: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/23.jpg)
Interesting Example
Peg Solitaire
26
• There are pegs on a board
• A peg can jump over another one into an adjacent empty square, so that the jumped-over peg is eliminated
• Target: Can we eliminate all but one peg ?
![Page 24: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/24.jpg)
Interesting Example
27
• Show that if we start with n n pegs (arranged as a square) on a board with infinite size, and n is not divisible by 3, then we can eliminate all but one peg
• Hint: Let P(n) denote the above proposition.
Show that P(1) and P(2) are true, and for all n,
P(3n+1) P(3n+5), P(3n+2) P(3n+4) are true
![Page 25: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/25.jpg)
Common Mistakes
28
• Show that
P(n) = “any n cats will have the same color”
is true for all positive integer n.
• Proof: The basic step P(1) is obviously true.
Next, assume P(k) is true. Then, when we have k + 1 cats, we can remove one of them, say y, so that by P(k), they will have the same color
![Page 26: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/26.jpg)
Common Mistakes
29
• Proof (continued):
Now, we exchange the removed cat with one of the other k cats :
y
y
![Page 27: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/27.jpg)
Common Mistakes
30
• Proof (continued):
Then, by P(k) again, y must have the same color as the other k – 1 cats.
This implies all the cats are of the same color!
• What’s wrong with the proof ?
![Page 28: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/28.jpg)
∀k ∈ .∑k
i=1 i = k(k+1)2
(By induction) Let P(k) be the predicate “∑k
i=1 i = k(k+1)2 ”
Base Case:∑0
i=1 i = 0 = 0(0+1)2 , thus P(0) is true
Inductive Hypothesis: Let k ≥ 0. We assume that P(k) is true,
i.e.∑k
i=1 i = k(k+1)2
Inductive Step:∑k+1
i=1 i =[∑k
i=1 i]
+ (k + 1)
= k(k+1)2 + (k + 1) (by I.H.)
= k(k+1)+2(k+1)2
= (k+1)(k+2)2
Thus P(k + 1) is true �
4 / 17
![Page 29: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/29.jpg)
∀k ∈ .∑k
i=1 i = k(k+1)2
(By induction) Let P(k) be the predicate “∑k
i=1 i = k(k+1)2 ”
Base Case:∑0
i=1 i = 0 = 0(0+1)2 , thus P(0) is true
Inductive Hypothesis: Let k ≥ 0. We assume that P(k) is true,
i.e.∑k
i=1 i = k(k+1)2
Inductive Step:∑k+1
i=1 i =[∑k
i=1 i]
+ (k + 1)
= k(k+1)2 + (k + 1) (by I.H.)
= k(k+1)+2(k+1)2
= (k+1)(k+2)2
Thus P(k + 1) is true �
4 / 17
![Page 30: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/30.jpg)
∀k ≥ 4. 2k < k!
(By induction) Let P(k) be the predicate “2k < k!”
Base Case: 24 = 16 < 24 = 4!, thus P(4) is true
Inductive Hypothesis: Let k ≥ 4. We assume that P(k) is true,i.e. 2k < k!
Inductive Step: 2k+1 = 2 · 2k< 2 · k! (by I.H.)< (k + 1) · k! (k ≥ 4)= (k + 1)!
Thus P(k + 1) is true �
6 / 17
![Page 31: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/31.jpg)
∀k ≥ 4. 2k < k!
(By induction) Let P(k) be the predicate “2k < k!”
Base Case: 24 = 16 < 24 = 4!, thus P(4) is true
Inductive Hypothesis: Let k ≥ 4. We assume that P(k) is true,i.e. 2k < k!
Inductive Step: 2k+1 = 2 · 2k< 2 · k! (by I.H.)< (k + 1) · k! (k ≥ 4)= (k + 1)!
Thus P(k + 1) is true �
6 / 17
![Page 32: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/32.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 33: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/33.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof:
By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 34: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/34.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.
Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 35: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/35.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3.
Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 36: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/36.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!
Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 37: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/37.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)
Induction Hypothesis: k3−k is divisible by 3.or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 38: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/38.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 39: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/39.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 40: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/40.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 41: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/41.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1)
= k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 42: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/42.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)
= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 43: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/43.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k
= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 44: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/44.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k
Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 45: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/45.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k
= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 46: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/46.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k)
Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 47: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/47.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp.
Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 48: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/48.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.
= 3(q+k2 +k) (Un)Distributive + over ×Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 49: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/49.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k)
(Un)Distributive + over ×Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 50: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/50.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 51: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/51.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 52: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/52.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).
=⇒ (k +1)3− (k +1) is divisible by 3.Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 53: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/53.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 54: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/54.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)
Thus, theorem holds by induction.
![Page 55: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/55.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 56: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/56.jpg)
Another Induction Proof.
Theorem: For every n ∈ N, n3−n is divisible by 3. (3|(n3−n) ).
Proof: By induction.Base Case: P(0) is “(03)−0” is divisible by 3. Yes!Induction Step: (∀k ∈ N),P(k) =⇒ P(k +1)Induction Hypothesis: k3−k is divisible by 3.
or k3−k = 3q for some integer q.
(k +1)3− (k +1) = k3 +3k2 +3k +1− (k +1)= k3 +3k2 +2k= (k3−k)+3k2 +3k Subtract/add k= 3q+3(k2 +k) Induction Hyp. Factor.= 3(q+k2 +k) (Un)Distributive + over ×
Or (k +1)3− (k +1) = 3(q+k2 +k).
(q+k2 +k) is integer (closed under addition and multiplication).=⇒ (k +1)3− (k +1) is divisible by 3.
Thus, (∀k ∈ N)P(k) =⇒ P(k +1)Thus, theorem holds by induction.
![Page 57: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/57.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah. Colorado. New Mexico. Arizona.
![Page 58: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/58.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.
States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah. Colorado. New Mexico. Arizona.
![Page 59: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/59.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.
(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah. Colorado. New Mexico. Arizona.
![Page 60: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/60.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah. Colorado. New Mexico. Arizona.
![Page 61: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/61.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states?
Utah. Colorado. New Mexico. Arizona.
![Page 62: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/62.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah.
Colorado. New Mexico. Arizona.
![Page 63: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/63.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah. Colorado.
New Mexico. Arizona.
![Page 64: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/64.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah. Colorado. New Mexico.
Arizona.
![Page 65: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/65.jpg)
Four Color Theorem.Theorem: Any map can be colored so that those regions that sharean edge have different colors.
Check Out: “Four corners”.States connected at a point, can have same color.(Couldn’t find a map where they did though.)
Quick Test: Which states? Utah. Colorado. New Mexico. Arizona.
![Page 66: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/66.jpg)
Two color theorem: example.Any map formed by dividing the plane into regions by drawing straightlines can be properly colored with two colors.
R
B
B
R
B
R
B
B RR
B
B
R
R
B
R
B
R
R BB
R
.
Fact: Swapping red and blue gives another valid colors.
![Page 67: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/67.jpg)
Two color theorem: example.Any map formed by dividing the plane into regions by drawing straightlines can be properly colored with two colors.
R
B
B
R
B
R
B
B RR
B
B
R
R
B
R
B
R
R BB
R
.
Fact: Swapping red and blue gives another valid colors.
![Page 68: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/68.jpg)
Two color theorem: example.Any map formed by dividing the plane into regions by drawing straightlines can be properly colored with two colors.
R
B
B
R
B
R
B
B RR
B
B
R
R
B
R
B
R
R BB
R
.
Fact: Swapping red and blue gives another valid colors.
![Page 69: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/69.jpg)
Two color theorem: example.Any map formed by dividing the plane into regions by drawing straightlines can be properly colored with two colors.
R
B
B
R
B
R
B
B RR
B
B
R
R
B
R
B
R
R BB
R
.
Fact: Swapping red and blue gives another valid colors.
![Page 70: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/70.jpg)
Two color theorem: example.Any map formed by dividing the plane into regions by drawing straightlines can be properly colored with two colors.
R
B
B
R
B
R
B
B RR
B
B
R
R
B
R
B
R
R BB
R
.
Fact: Swapping red and blue gives another valid colors.
![Page 71: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/71.jpg)
Two color theorem: example.Any map formed by dividing the plane into regions by drawing straightlines can be properly colored with two colors.
R
B
B
R
B
R
B
B RR
B
B
R
R
B
R
B
R
R BB
R
.
Fact: Swapping red and blue gives another valid colors.
![Page 72: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/72.jpg)
Two color theorem: example.Any map formed by dividing the plane into regions by drawing straightlines can be properly colored with two colors.
R
B
B
R
B
R
B
B RR
B
B
R
R
B
R
B
R
R BB
R
.
Fact: Swapping red and blue gives another valid colors.
![Page 73: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/73.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switch
R
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 74: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/74.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switch
R
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 75: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/75.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switch
R
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.
2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 76: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/76.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switch
R
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions
3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 77: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/77.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switch
R
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 78: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/78.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 79: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/79.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switch
R
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 80: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/80.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 81: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/81.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 82: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/82.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 83: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/83.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switch
B
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 84: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/84.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switchB
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 85: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/85.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switchB
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 86: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/86.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switchB
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 87: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/87.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switchB
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 88: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/88.jpg)
Two color theorem: proof illustration.
R
B
R
B
R
B
switchR
B
B
R
R
B
B
R
R
B
B
switchB
B
B
R
R
R
R
B
R
R
B
R
B
B RR
R
B
switc
h color
s
R
B
B
R
B
R
B
B RR
B
Base Case.
1. Add line.2. Get inherited color for split regions3. Switch on one side of new line.(Fixes conflicts along line, and makes no new ones.)
Algorithm gives P(k) =⇒ P(k +1).
![Page 89: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/89.jpg)
Every natural number k > 1 can be written as aproduct of primes
(By induction) Let P(k) be the predicate “k can be written as aproduct of primes”
Base Case: Since 2 is a prime number, P(2) is true
Inductive Hypothesis: Let k ≥ 1. We assume that P(k) is true,i.e. “k can be written as a product of primes”
Inductive Step: We distinguish two cases: (i) Case k + 1 is aprime, then P(k + 1) is true; (ii) Case k + 1 is not a prime. Thenby definition of primality, there must exist 1 < n,m < k + 1 suchthat k + 1 = n ·m. But then we know by I.H. that n and m can bewritten as a product of primes (since n,m ≤ k). Therefore, k + 1can also be written as a product of primes. Thus, P(k + 1) is true�
−→ If we had only assumed P(k) to be true, then we could notapply our I.H. to n and m
9 / 17
![Page 90: Lecture 3: Method of Inductionbbm205/Lectures/Lecture3.pdf · into two groups: those smaller than x , those larger than x. Next, apply Quicksort to sort each group (putting x in-between](https://reader034.vdocuments.site/reader034/viewer/2022051916/6007968ccac1e54cfa04e40d/html5/thumbnails/90.jpg)
Every natural number k > 1 can be written as aproduct of primes
(By induction) Let P(k) be the predicate “k can be written as aproduct of primes”
Base Case: Since 2 is a prime number, P(2) is true
Inductive Hypothesis: Let k ≥ 1. We assume that P(k) is true,i.e. “k can be written as a product of primes”
Inductive Step: We distinguish two cases: (i) Case k + 1 is aprime, then P(k + 1) is true; (ii) Case k + 1 is not a prime. Thenby definition of primality, there must exist 1 < n,m < k + 1 suchthat k + 1 = n ·m. But then we know by I.H. that n and m can bewritten as a product of primes (since n,m ≤ k). Therefore, k + 1can also be written as a product of primes. Thus, P(k + 1) is true�−→ If we had only assumed P(k) to be true, then we could notapply our I.H. to n and m
9 / 17