Induction for series and sequences

Induction for series and sequences Flashcards

Spec A1 · AQA A-Level Further Maths: Flashcards

Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.

12 cards

Tap a card to flip it. Swipe right if you knew it, left if not.

See all 12 cards
What are the four stages of a proof by induction?
Basis step, inductive hypothesis, inductive step, conclusion.
What is the basis step?
Show the statement is true for n=1n=1, evaluating both sides.
What is the inductive hypothesis?
Assume the statement is true for n=kn=k, for some positive integer kk.
Write ∑r=1k+1f(r)\sum_{r=1}^{k+1}f(r) using ∑r=1kf(r)\sum_{r=1}^{k}f(r).
∑r=1kf(r)+f(k+1)\sum_{r=1}^{k}f(r)+f(k+1)
What is ∑r=1nr\sum_{r=1}^{n}r?
n(n+1)2\frac{n(n+1)}{2}
What is ∑r=1nr2\sum_{r=1}^{n}r^2?
16n(n+1)(2n+1)\frac16n(n+1)(2n+1)
What is ∑r=1nr3\sum_{r=1}^{n}r^3?
14n2(n+1)2\frac14n^2(n+1)^2
What is ∑r=1n(2r−1)\sum_{r=1}^{n}(2r-1)?
n2n^2
Simplify kk+1+1(k+1)(k+2)\frac{k}{k+1}+\frac{1}{(k+1)(k+2)}.
k+1k+2\frac{k+1}{k+2}
How do you reach uk+1u_{k+1} in a recurrence proof?
Substitute the hypothesis for uku_k into the recurrence uk+1=f(uk)u_{k+1}=f(u_k).
Write a full conclusion.
True for n=1n=1; if true for n=kn=k then true for n=k+1n=k+1; so true for all positive integers nn by induction.
Which common error occurs when adding the new term?
Adding the kkth term again instead of the (k+1)(k+1)th term f(k+1)f(k+1).

Flashcards