mathematical induction - cornell universityprinciple of mathematical induction variants – can...
TRANSCRIPT
![Page 1: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/1.jpg)
Mathematical Induction
CS 2800: Discrete Structures, Spring 2015
Sid Chaudhuri
![Page 2: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/2.jpg)
Prime factorizability
● A prime number is a positive integer with exactly two divisors: 1 and itself– 2, 3, 5, 7, 11, 13, 17, …
![Page 3: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/3.jpg)
Prime factorizability
● A prime number is a positive integer with exactly two divisors: 1 and itself– 2, 3, 5, 7, 11, 13, 17, …
● Claim: Every natural number ≥ 2 can be expressed as a finite product of prime numbers– E.g. 3 = 3
15 = 3 × 5 16 = 2 × 2 × 2 × 2
![Page 4: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/4.jpg)
17
![Page 5: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/5.jpg)
17
Is it prime?
![Page 6: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/6.jpg)
17
Is it prime?
Yes!
![Page 7: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/7.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
![Page 8: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/8.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
![Page 9: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/9.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
![Page 10: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/10.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
![Page 11: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/11.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
Is it prime? Is it prime?
![Page 12: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/12.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
Is it prime?
Yes!
Is it prime?
![Page 13: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/13.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
Is it prime?
Yes!
Is it prime?
No :( it's 2 × 2
![Page 14: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/14.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
Is it prime?
Yes!
Is it prime?
No :( it's 2 × 2
Is it prime? Is it prime?
![Page 15: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/15.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
Is it prime?
Yes!
Is it prime?
No :( it's 2 × 2
Is it prime?
Yes!
Is it prime?
![Page 16: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/16.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
Is it prime?
Yes!
Is it prime?
No :( it's 2 × 2
Is it prime?
Yes!
Is it prime?
Yes!
![Page 17: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/17.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
(And there was much rejoicing)
Is it prime?
Yes!
Is it prime?
No :( it's 2 × 2
Is it prime?
Yes!
Is it prime?
Yes!
![Page 18: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/18.jpg)
17
Is it prime?
Yes!(And there was much rejoicing)
20
Is it prime?
No :( it's 5 × 4
(And there was much rejoicing)
Is it prime?
Yes!
Is it prime?
No :( it's 2 × 2
Is it prime?
Yes!
Is it prime?
Yes!Top-down
(recursion)
Bottom-up
(dynamicprogramming)
![Page 19: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/19.jpg)
Prime factorizability
● Claim: Every natural number ≥ 2 can be expressed as a finite product of prime numbers
![Page 20: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/20.jpg)
Prime factorizability
● Claim: Every natural number ≥ 2 can be expressed as a finite product of prime numbers
● Proof:– Let's start with 2. This is trivially the product of one
prime number. So the claim is true for 2.
![Page 21: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/21.jpg)
Prime factorizability
● Claim: Every natural number ≥ 2 can be expressed as a finite product of prime numbers
● Proof:– Let's start with 2. This is trivially the product of one
prime number. So the claim is true for 2.– Now assume the claim is true for all natural numbers
from 2 to n
![Page 22: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/22.jpg)
Prime factorizability
● Claim: Every natural number ≥ 2 can be expressed as a finite product of prime numbers
● Proof:– Let's start with 2. This is trivially the product of one
prime number. So the claim is true for 2.– Now assume the claim is true for all natural numbers
from 2 to n
Which n? We'll assume n is arbitrary, but ≥ 2
![Page 23: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/23.jpg)
Prime factorizability● Proof (contd):
– (We've assumed the claim is true for all natural numbers from 2 to n)
![Page 24: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/24.jpg)
Prime factorizability● Proof (contd):
– (We've assumed the claim is true for all natural numbers from 2 to n)
– Consider n + 1
![Page 25: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/25.jpg)
Prime factorizability● Proof (contd):
– (We've assumed the claim is true for all natural numbers from 2 to n)
– Consider n + 1● If it is prime, then the claim is trivially true for n + 1
![Page 26: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/26.jpg)
Prime factorizability● Proof (contd):
– (We've assumed the claim is true for all natural numbers from 2 to n)
– Consider n + 1● If it is prime, then the claim is trivially true for n + 1
● If it is composite, then it is (by definition), the product of two natural numbers a and b, both > 1 but < n + 1
![Page 27: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/27.jpg)
Prime factorizability● Proof (contd):
– (We've assumed the claim is true for all natural numbers from 2 to n)
– Consider n + 1● If it is prime, then the claim is trivially true for n + 1
● If it is composite, then it is (by definition), the product of two natural numbers a and b, both > 1 but < n + 1
● Since the claim is assumed to be true for all natural numbers from 2 to n, it is also true for a and b
![Page 28: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/28.jpg)
Prime factorizability● Proof (contd):
– (We've assumed the claim is true for all natural numbers from 2 to n)
– Consider n + 1● If it is prime, then the claim is trivially true for n + 1
● If it is composite, then it is (by definition), the product of two natural numbers a and b, both > 1 but < n + 1
● Since the claim is assumed to be true for all natural numbers from 2 to n, it is also true for a and b
● So a = p1 p
2 p
3 ... p
m and b = q
1 q
2 q
3 ... q
k, where all p
i, q
j are prime
![Page 29: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/29.jpg)
Prime factorizability● Proof (contd):
– (We've assumed the claim is true for all natural numbers from 2 to n)
– Consider n + 1● If it is prime, then the claim is trivially true for n + 1
● If it is composite, then it is (by definition), the product of two natural numbers a and b, both > 1 but < n + 1
● Since the claim is assumed to be true for all natural numbers from 2 to n, it is also true for a and b
● So a = p1 p
2 p
3 ... p
m and b = q
1 q
2 q
3 ... q
k, where all p
i, q
j are prime
● So n + 1 = p1 p
2 … p
m q
1 q
2 ... q
k, i.e. the claim is true for n + 1
![Page 30: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/30.jpg)
Prime factorizability● What have we shown?
![Page 31: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/31.jpg)
Prime factorizability● What have we shown?
– 2 is a finite product of prime numbers
![Page 32: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/32.jpg)
Prime factorizability● What have we shown?
– 2 is a finite product of prime numbers– For any n ≥ 2, if all natural numbers from 2 to n are
finite products of prime numbers, then so is n + 1
![Page 33: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/33.jpg)
Prime factorizability● What have we shown?
– 2 is a finite product of prime numbers– For any n ≥ 2, if all natural numbers from 2 to n are
finite products of prime numbers, then so is n + 1
● Can we conclude that all natural numbers ≥ 2 are finite products of prime numbers?
![Page 34: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/34.jpg)
Prime factorizability● What have we shown?
– 2 is a finite product of prime numbers– For any n ≥ 2, if all natural numbers from 2 to n are
finite products of prime numbers, then so is n + 1
● Can we conclude that all natural numbers ≥ 2 are finite products of prime numbers?– Yes!
![Page 35: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/35.jpg)
Prime factorizability● What have we shown?
– 2 is a finite product of prime numbers– For any n ≥ 2, if all natural numbers from 2 to n are
finite products of prime numbers, then so is n + 1
● Can we conclude that all natural numbers ≥ 2 are finite products of prime numbers?– Yes!– If it's true for 2, it must be true for 3. If it's true for 3,
it must be true for 4. If it's true for 4...
![Page 36: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/36.jpg)
Prime factorizability● What have we shown?
– 2 is a finite product of prime numbers– For any n ≥ 2, if all natural numbers from 2 to n are
finite products of prime numbers, then so is n + 1
● Can we conclude that all natural numbers ≥ 2 are finite products of prime numbers?– Yes!– If it's true for 2, it must be true for 3. If it's true for 3,
it must be true for 4. If it's true for 4...– We've applied the Principle of Mathematical Induction
![Page 37: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/37.jpg)
Principle of Mathematical Induction
● We need to prove statement S(n) about natural numbers n
![Page 38: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/38.jpg)
Principle of Mathematical Induction
● We need to prove statement S(n) about natural numbers n
● If we can show that– Base case: S(0) is true, and
![Page 39: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/39.jpg)
Principle of Mathematical Induction
● We need to prove statement S(n) about natural numbers n
● If we can show that– Base case: S(0) is true, and– Inductive step: Assumption that S(k) is true for all
natural numbers k ≤ n implies that S(n + 1) is true
![Page 40: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/40.jpg)
Principle of Mathematical Induction
● We need to prove statement S(n) about natural numbers n
● If we can show that– Base case: S(0) is true, and– Inductive step: Assumption that S(k) is true for all
natural numbers k ≤ n implies that S(n + 1) is true
Inductive hypothesis
![Page 41: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/41.jpg)
Principle of Mathematical Induction
● We need to prove statement S(n) about natural numbers n
● If we can show that– Base case: S(0) is true, and– Inductive step: Assumption that S(k) is true for all
natural numbers k ≤ n implies that S(n + 1) is true
● … then S(n) is true for all natural numbers n
Inductive hypothesis
![Page 42: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/42.jpg)
Principle of Mathematical Induction
● Variants
![Page 43: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/43.jpg)
Principle of Mathematical Induction
● Variants– Can start from an integer k which is not 0. The
statement is then proved for all integers ≥ k● Starting from a negative number doesn't change the
applicability of induction, but be careful when stating the inductive hypothesis and when proving the inductive step!
![Page 44: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/44.jpg)
Principle of Mathematical Induction
● Variants– Can start from an integer k which is not 0. The
statement is then proved for all integers ≥ k● Starting from a negative number doesn't change the
applicability of induction, but be careful when stating the inductive hypothesis and when proving the inductive step!
– Can start with multiple base cases, i.e. directly prove S(0), S(1), ..., S(m) and use induction for all integers greater than m
![Page 45: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/45.jpg)
Principle of Mathematical Induction
● Variants– Can start from an integer k which is not 0. The
statement is then proved for all integers ≥ k● Starting from a negative number doesn't change the
applicability of induction, but be careful when stating the inductive hypothesis and when proving the inductive step!
– Can start with multiple base cases, i.e. directly prove S(0), S(1), ..., S(m) and use induction for all integers greater than m
– Can apply to any countable set (prove!)
![Page 46: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/46.jpg)
Example: Sum of the natural numbers
● S(n) = “0 + 1 + 2 + 3 + … + n = n(n + 1) / 2”
![Page 47: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/47.jpg)
Example: Sum of the natural numbers
● S(n) = “0 + 1 + 2 + 3 + … + n = n(n + 1) / 2”
● Base case: 0 = 0(0 + 1)/2, hence S(0) is true
![Page 48: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/48.jpg)
Example: Sum of the natural numbers
● S(n) = “0 + 1 + 2 + 3 + … + n = n(n + 1) / 2”
● Base case: 0 = 0(0 + 1)/2, hence S(0) is true● Inductive step:
– Assume 0 + 1 + 2 + … + k = k (k + 1) / 2 for all natural numbers k ≤ n
![Page 49: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/49.jpg)
Example: Sum of the natural numbers
● S(n) = “0 + 1 + 2 + 3 + … + n = n(n + 1) / 2”
● Base case: 0 = 0(0 + 1)/2, hence S(0) is true● Inductive step:
– Assume 0 + 1 + 2 + … + k = k (k + 1) / 2 for all natural numbers k ≤ n
– Then 0 + 1 + 2 + … + n + (n + 1) = n(n + 1) / 2 + (n + 1)
![Page 50: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/50.jpg)
Example: Sum of the natural numbers
● S(n) = “0 + 1 + 2 + 3 + … + n = n(n + 1) / 2”
● Base case: 0 = 0(0 + 1)/2, hence S(0) is true● Inductive step:
– Assume 0 + 1 + 2 + … + k = k (k + 1) / 2 for all natural numbers k ≤ n
– Then 0 + 1 + 2 + … + n + (n + 1) = n(n + 1) / 2 + (n + 1) = (n + 1)(n + 2) / 2
![Page 51: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/51.jpg)
Example: Sum of the natural numbers
● S(n) = “0 + 1 + 2 + 3 + … + n = n(n + 1) / 2”
● Base case: 0 = 0(0 + 1)/2, hence S(0) is true● Inductive step:
– Assume 0 + 1 + 2 + … + k = k (k + 1) / 2 for all natural numbers k ≤ n
– Then 0 + 1 + 2 + … + n + (n + 1) = n(n + 1) / 2 + (n + 1) = (n + 1)(n + 2) / 2
– Hence S(n + 1) is true
![Page 52: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/52.jpg)
Example: Sum of the natural numbers
● S(n) = “0 + 1 + 2 + 3 + … + n = n(n + 1) / 2”
● Base case: 0 = 0(0 + 1)/2, hence S(0) is true● Inductive step:
– Assume 0 + 1 + 2 + … + k = k (k + 1) / 2 for all natural numbers k ≤ n
– Then 0 + 1 + 2 + … + n + (n + 1) = n(n + 1) / 2 + (n + 1) = (n + 1)(n + 2) / 2
– Hence S(n + 1) is true
● Hence by induction, S(n) is true for all n ∈ N
![Page 53: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/53.jpg)
Example: Tiling with triominoes
S(n) = “A 2n × 2n chessboard with one corner missing can be tiled with triominoes”
![Page 54: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/54.jpg)
Example: Tiling with triominoes
Base case: A 1 × 1 chessboard with one corner missing is empty, so S(0) is true
![Page 55: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/55.jpg)
Example: Tiling with triominoes
Another base case (although this isn't necessary): A 2 × 2 chessboard with one corner missing is just a single triomino, so S(1) is true
![Page 56: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/56.jpg)
Example: Tiling with triominoes
● Inductive step:– Assume a 2k × 2k chessboard with a corner missing can
be tiled with triominoes, for all natural numbers k ≤ n
– Consider a 2n + 1 × 2n + 1 board (with a corner missing)
![Page 57: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/57.jpg)
Example: Tiling with triominoes
![Page 58: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/58.jpg)
Example: Tiling with triominoes
![Page 59: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/59.jpg)
Example: Tiling with triominoes
● Inductive step:– Assume a 2k × 2k chessboard with a corner missing can
be tiled with triominoes, for all natural numbers k ≤ n
– Consider a 2n + 1 × 2n + 1 board (with a corner missing)– It is just four 2n × 2n boards, plus one triomino
![Page 60: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/60.jpg)
Example: Tiling with triominoes
● Inductive step:– Assume a 2k × 2k chessboard with a corner missing can
be tiled with triominoes, for all natural numbers k ≤ n
– Consider a 2n + 1 × 2n + 1 board (with a corner missing)– It is just four 2n × 2n boards, plus one triomino– From the inductive hypothesis, we know each of these
boards can be tiled with triominoes
![Page 61: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/61.jpg)
Example: Tiling with triominoes
● Inductive step:– Assume a 2k × 2k chessboard with a corner missing can
be tiled with triominoes, for all natural numbers k ≤ n
– Consider a 2n + 1 × 2n + 1 board (with a corner missing)– It is just four 2n × 2n boards, plus one triomino– From the inductive hypothesis, we know each of these
boards can be tiled with triominoes– Hence S(n + 1) is true
![Page 62: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/62.jpg)
Example: Tiling with triominoes
● Inductive step:– Assume a 2k × 2k chessboard with a corner missing can
be tiled with triominoes, for all natural numbers k ≤ n
– Consider a 2n + 1 × 2n + 1 board (with a corner missing)– It is just four 2n × 2n boards, plus one triomino– From the inductive hypothesis, we know each of these
boards can be tiled with triominoes– Hence S(n + 1) is true
● Hence by induction, S(n) is true for all n ∈ N
![Page 63: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/63.jpg)
Example: Fibonacci program
S(n) = “The following program returns the nth Fibonacci number, given input n”
int fibonacci(int n){ if (n <= 1) return 1; else return fibonacci(n – 1) + fibonacci(n – 2);}
![Page 64: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/64.jpg)
Example: Fibonacci program
S(n) = “The following program returns the nth Fibonacci number, given input n”
int fibonacci(int n){ if (n <= 1) return 1; else return fibonacci(n – 1) + fibonacci(n – 2);}
1, 1, 2, 3, 5, 8, 13, 21, 34, ...
![Page 65: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/65.jpg)
Example: Fibonacci program
S(n) = “The following program returns the nth Fibonacci number, given input n”
int fibonacci(int n){ if (n <= 1) return 1; else return fibonacci(n – 1) + fibonacci(n – 2);}
1, 1, 2, 3, 5, 8, 13, 21, 34, ...
Precondition: n ≥ 0
Startingfrom 0
![Page 66: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/66.jpg)
Example: Fibonacci program
● Base cases: fibonacci(0) and fibonacci(1) return the first two Fibonacci numbers (1 and 1, easily verified), so S(0) and S(1) are true
int fibonacci(int n){ if (n <= 1) return 1; else return fibonacci(n – 1) + fibonacci(n – 2);}
![Page 67: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/67.jpg)
Example: Fibonacci program● Inductive step:
– Assume, for n ≥ 2, that fibonacci(k) returns the kth Fibonacci number for all k ≤ n
![Page 68: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/68.jpg)
Example: Fibonacci program● Inductive step:
– Assume, for n ≥ 2, that fibonacci(k) returns the kth Fibonacci number for all k ≤ n
– Consider fibonacci(n + 1)
![Page 69: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/69.jpg)
Example: Fibonacci program● Inductive step:
– Assume, for n ≥ 2, that fibonacci(k) returns the kth Fibonacci number for all k ≤ n
– Consider fibonacci(n + 1)
● From the program, it returnsfibonacci(n) + fibonacci(n – 1)
![Page 70: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/70.jpg)
Example: Fibonacci program● Inductive step:
– Assume, for n ≥ 2, that fibonacci(k) returns the kth Fibonacci number for all k ≤ n
– Consider fibonacci(n + 1)
● From the program, it returnsfibonacci(n) + fibonacci(n – 1)
● From the inductive hypothesis, these are the nth and (n – 1)th Fibonacci numbers, respectively
![Page 71: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/71.jpg)
Example: Fibonacci program● Inductive step:
– Assume, for n ≥ 2, that fibonacci(k) returns the kth Fibonacci number for all k ≤ n
– Consider fibonacci(n + 1)
● From the program, it returnsfibonacci(n) + fibonacci(n – 1)
● From the inductive hypothesis, these are the nth and (n – 1)th Fibonacci numbers, respectively
● Hence by definition of Fibonacci numbers, fibonacci(n + 1) returns the (n + 1)th Fibonacci number, i.e. S(n + 1) is true
![Page 72: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/72.jpg)
Example: Fibonacci program● Inductive step:
– Assume, for n ≥ 2, that fibonacci(k) returns the kth Fibonacci number for all k ≤ n
– Consider fibonacci(n + 1)
● From the program, it returnsfibonacci(n) + fibonacci(n – 1)
● From the inductive hypothesis, these are the nth and (n – 1)th Fibonacci numbers, respectively
● Hence by definition of Fibonacci numbers, fibonacci(n + 1) returns the (n + 1)th Fibonacci number, i.e. S(n + 1) is true
● Hence by induction, S(n) is true for all n ∈ N
![Page 73: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/73.jpg)
Example: Fibonacci program● Inductive step:
– Assume, for n ≥ 2, that fibonacci(k) returns the kth Fibonacci number for all k ≤ n
– Consider fibonacci(n + 1)
● From the program, it returnsfibonacci(n) + fibonacci(n – 1)
● From the inductive hypothesis, these are the nth and (n – 1)th Fibonacci numbers, respectively
● Hence by definition of Fibonacci numbers, fibonacci(n + 1) returns the (n + 1)th Fibonacci number, i.e. S(n + 1) is true
● Hence by induction, S(n) is true for all n ∈ N
![Page 74: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/74.jpg)
All horses are the same color
www.clipartof.com, www.fg-a.com
![Page 75: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/75.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”
![Page 76: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/76.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”
Doesn't say anything about whether differentgroups of n horses have different colors or not
![Page 77: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/77.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)
![Page 78: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/78.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)● Inductive step:
– Assume any group of k ≤ n horses is the same color
![Page 79: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/79.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)● Inductive step:
– Assume any group of k ≤ n horses is the same color
– A group of n + 1 horses can be expressed as the union of two groups of n horses each
![Page 80: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/80.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)● Inductive step:
– Assume any group of k ≤ n horses is the same color
– A group of n + 1 horses can be expressed as the union of two groups of n horses each
– These two groups are individually the same color, by hypothesis
![Page 81: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/81.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)● Inductive step:
– Assume any group of k ≤ n horses is the same color
– A group of n + 1 horses can be expressed as the union of two groups of n horses each
– These two groups are individually the same color, by hypothesis
– … and they overlap
![Page 82: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/82.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)● Inductive step:
– Assume any group of k ≤ n horses is the same color
– A group of n + 1 horses can be expressed as the union of two groups of n horses each
– These two groups are individually the same color, by hypothesis
– … and they overlap
– So the group of n + 1 horses is the same color
![Page 83: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/83.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)● Inductive step:
– Assume any group of k ≤ n horses is the same color
– A group of n + 1 horses can be expressed as the union of two groups of n horses each
– These two groups are individually the same color, by hypothesis
– … and they overlap
– So the group of n + 1 horses is the same color
● Hence by induction, all horses are the same color
![Page 84: Mathematical Induction - Cornell UniversityPrinciple of Mathematical Induction Variants – Can start from an integer k which is not 0. The statement is then proved for all integers](https://reader036.vdocuments.site/reader036/viewer/2022071406/60fb8ac2b35147190752f3c3/html5/thumbnails/84.jpg)
All horses are the same color● S(n) = “Any group of n horses is the same color”● Base case: A single horse is obviously the same color as
itself, so S(1) is true (and S(0) is trivially true)● Inductive step:
– Assume any group of k ≤ n horses is the same color
– A group of n + 1 horses can be expressed as the union of two groups of n horses each
– These two groups are individually the same color, by hypothesis
– … and they overlap
– So the group of n + 1 horses is the same color
● Hence by induction, all horses are the same color
Not for n = 1 !