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 - Maths Class 9

Remove Ads Take short quiz All Quiz and Worksheets
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.