Use the
If S(n) is true, then S(n + 1) is true
form of the Inductive Step to prove the statement in Example 2.5.1.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.