2b)
Let P(n) be the claim: | n |
|
= |
|
for all integers n![]() |
||||
S | |||||||||
j = 1 |
P(1) is the statement: | 1 |
|
= |
|
|||||
S | |||||||||
j = 1 | |||||||||
P(k) is the statement: | k |
|
= |
|
|||||
S | |||||||||
i = 1 | |||||||||
P(k+1) is the statement: | k + 1 |
|
= |
|
|||||
S | |||||||||
i = 1 |
For a proof by induction, you first need to check that the statement P(1) is true. Then assume that P(k) is true and use this to show that P(k + 1) is true.