1. Induction: (a) Prove that for the sequence given by a_1 = 1, a_{n+1} = a_{n +1} /a_n , 3/2 ≥ a_n ≥ 2.
Added by Kayla H.
Step 1
a_1 = 1 a_2 = a_2 / a_1 = a_2 / 1 = a_2 a_3 = a_3 / a_2 a_4 = a_4 / a_3 We can see that the terms are getting smaller, so it's likely that 3/2 ≥ a_n ≥ 2. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Dalia Fantini and 80 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Using mathematical induction, prove that the $n$ th term of the sequence $a, a+d, a+2 d, \ldots$ is given by $$a_{n}=a+(n-1) d$$
Additional Topics in Algebra
Arithmetic Sequences and Series
4. (Explicit formula of a recursive sequence) We define a sequence by b0 = 3, b1 = 14 bn = 7bn-1 - 12bn-2 for n ≥ 2 Use "strong" induction to show that bn = 5 * 4^n - 2 * 3^n for all n ≥ 0.
Madhur L.
Let the numbers a0 = 1, a1 = 3, and an = 4(an-1 - an-2) for n ≥ 2. Prove using induction that an = 2n - 1(n + 2) for all n ≥ 0.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD