Q. 66
Question
Use the principle of mathematical induction to prove that if for every k ≥ N, then . Proving this implication completes our proof of the ratio test.
Step-by-Step Solution
Verified Answer
Hence, proved.
1Step 1. Given Information.
Given
2Step 2. Proof.
Let suppose it is true for k=N, then
For k=N+1, we get:
The result is true for k=N.
Assume that the result is true for k=N+n-1,
Now we have to prove it for k=N+n.
3Step 3. Proof part 2.
Other exercises in this chapter
Q. 63
(a) Show that the series ∑k=1∞k!kk converges.(b) Explain why part (a) proves thatlimk→∞k!kk=0.(c) Explain why part (b) proves that
View solution Q. 1TF
A series of monomials: Find all values of x for which the series ∑k=1∞x2kk!. converges.
View solution Q. 67
Prove that the ratio test will be inconclusive on every series of the form ∑k=1∞ak where ak is a rational function of k.
View solution Q 68.
Prove the root test. You may model your proof on the proof of the ratio test
View solution