The problem that was used to introduce ordinary mathematical induction in Section 5.2 can also be solved using strong mathematical induction. Let P(n) be “any n¢ can be obtained using a combination of 3¢ and 5¢ coins.” Use strong mathematical induction to prove that P (n) is true for all integers n ≥ 8.
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.