InterviewSolution
Saved Bookmarks
| 1. |
Using the principle of mathematical induction, prove each of the following for all `n in N` `3^(n) ge 2^(n)` |
|
Answer» Clearly, ` 3^(1) ge 2^(1)`. So, the result is true for n = 1. Let it be true for n = k. Then, ` 3^(k) gt 2^(k) and 3 gt 2 rArr 3^(k) * 3 ge 2^(k) * 2 rArr 3^(k+1) ge 2 ^(k+1)`. So, whenever the result is true for k, then it is also true for (k+1). |
|