Suppose W1 = 1 , W2 = 2 and for n > 2, Wn = W1 + W2 + … + Wn–2 + 2 - End-of-Chapter Exercises

part 2 - Question 15 - End-of-Chapter Exercises - Chapter 8 - Predicting What Comes Next: Exploring Sequences & Progress - Class 9

Take a fresh quiz. Then take another.
Every attempt is a new AI-adaptive Teachoo quiz with 8 questions, selected from your answers, mistakes, and progress.
Remove Ads
Teachoo ยท Class 9 Explore Class 9

Transcript

Question 15 Suppose W_1=1,ใ€–" " Wใ€—_2=2 and for ๐‘›>2,ใ€–" " Wใ€—_n=W_1+W_2+โ‹ฏ+W_(nโˆ’2)+2. Find the values of W_1,ใ€–" " Wใ€—_2,โ€ฆ,ใ€–" " Wใ€—_8. Do you recognise this sequence? Finding the values of ๐‘พ_๐Ÿ to ๐‘พ_๐Ÿ– Let's calculate carefully: ๐‘Š_1=๐Ÿ (Given) ๐‘Š_2=๐Ÿ (Given) ๐‘Š_3=๐‘Š_1+2=1+2=๐Ÿ‘ ๐‘Š_4=๐‘Š_1+๐‘Š_2+2=1+2+2=๐Ÿ“ ๐‘Š_5=๐‘Š_1+๐‘Š_2+๐‘Š_3+2=1+2+3+2=๐Ÿ– ๐‘Š_6=(1+2+3+5)+2=๐Ÿ๐Ÿ‘ ๐‘Š_7=(1+2+3+5+8)+2=๐Ÿ๐Ÿ ๐‘Š_8=(1+2+3+5+8+13)+2=๐Ÿ‘๐Ÿ’ The first 8 values are: 1,2,3,5,8,13,21,34 2. Do you recognize this sequence? Yes. This is the Fibonacci sequence. Even though the problem gave a complicated, drawn-out recursive rule involving adding 2 , the result is identical to the standard Fibonacci rule where every number is simply the sum of the two numbers right before it ( ๐‘Š_๐‘›=๐‘Š_(๐‘›โˆ’1)+๐‘Š_(๐‘›โˆ’2) ).

Davneet Singh's photo - Co-founder, Teachoo

Made by

Davneet Singh

Davneet Singh is an IIT Kanpur graduate and has been teaching for 16+ years. At Teachoo, he breaks down Maths, Science and Computer Science into simple steps so students understand concepts deeply and score with confidence.

Many students prefer Teachoo Black for a smooth, ad-free learning experience.