problems to solve involving induction proof by induction basis step: does it work for n=0?
TRANSCRIPT
![Page 1: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/1.jpg)
Problems to Solve Involving Induction
![Page 2: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/2.jpg)
Proof by Induction
Basis Step: Does it work for n=0?
ark
k0
n
arn1 a
r 1,r 1?
ark
k0
0
ar0 a
ar01 ar 1
ar ar 1
a(r 1)
r 1a
![Page 3: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/3.jpg)
Inductive Step
Assume that for r1
We must show that
ark
k0
n
arn1 a
r 1
ark
k0
n1
ar(n1)1 a
r 1
![Page 4: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/4.jpg)
ark
k0
n1
arn1 arkk0
n
arn1 arn1 ar 1
arn1(r 1) arn1 a
r 1
arn2 arn1 arn1 a
r 1
ar(n1)1 ar 1
![Page 5: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/5.jpg)
Prove that is O(n2)
(3j 2j1
n
)
First let’s find a closed form solution for the sum.
= 3n(n+1)/2 - 2n = (3n2 + 3n -4n)/2 = (3n2 -n)/2
(3j 2
j1
n
) 3 jj1
n
2 1j1
n
![Page 6: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/6.jpg)
How can we be sure that our arithmetic is correct?
Prove that
Proof by Induction
Basis Step:
For n=1
(3j 2
j1
n
) 3n2 n
2
(3 j 2j1
1
) 3(1) 2 1
3(1)2 1
2
2
21
![Page 7: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/7.jpg)
Inductive Step
Assume that
Then we must show that:
(3j 2
j1
n
) 3n2 n
2
(3j 2
j1
n1
) 3(n1)2 (n1)
2
![Page 8: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/8.jpg)
(3j 2j1
n1
) (3 j 2)j1
n
3(n1) 2
3n2 n2
3(n1) 2
3n2 n 6(n1) 4
2
3n2 5n 2
2
3n2 6n 3 n 1
2
3(n2 2n1) (n1)
2
3(n 1)2 (n1)
2
![Page 9: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/9.jpg)
Big-Oh
(3n2 -n)/2 is clearly O(n2) since
(3n2 -n)/2 (3n2 -n) 3n2 since n is positive.
So chose C = 3 and k=1 and we have
| (3n2 -n)/2| (3) |n2 | when n > 1.
![Page 10: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/10.jpg)
Does 1*1! + 2*2! + 3*3!+…+n*n! = (n+1)! -1 n1?
Basis Step: n = 1
1*1! = 1, (1+1)!-1 = 2-1=1
Inductive Step:
Assume that
1*1! + 2*2! + 3*3!+…+n*n! = (n+1)! -1
We must show that
1*1!+2*2!+3*3!+…+n*n!+(n+1)*(n+1)! =(n+2)!-1
![Page 11: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/11.jpg)
1*1!+2*2!+3*3!+…+n*n!+(n+1)*(n+1)!
= (n+1)! -1 + (n+1)*(n+1)!
= (n+1+1)(n+1)! -1
= (n+2)(n+1)! - 1
= (n+2)! - 1
![Page 12: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/12.jpg)
Prove that every 2n by 2n (n > 1) chessboard can be tiled with T-ominos
![Page 13: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/13.jpg)
Basis Case: 22 x 22 Board
![Page 14: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/14.jpg)
Basis Case: 22 x 22 Board
![Page 15: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/15.jpg)
Basis Case: 22 x 22 Board
![Page 16: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/16.jpg)
Basis Case: 22 x 22 Board
![Page 17: Problems to Solve Involving Induction Proof by Induction Basis Step: Does it work for n=0?](https://reader035.vdocuments.site/reader035/viewer/2022072008/56649d755503460f94a568c4/html5/thumbnails/17.jpg)
Inductive Step
Assume that we can tile a board of size 2n by 2n. We must show that this implies that we can tile a board of size 2n+1 by 2n+1.
Proof: Divide the 2n+1 by 2n+1 board into 4 parts, each of size 2n by 2n. Since we know that each of these boards can be tiled, then we can put them together to tile the 2n+1 by 2n+1 board.