# A sequence is defined by the recursive formula f (n + 1) = f(n) – 2. if f(1) = 18, what is f(5)?,

0
569

The Fibonacci sequence is a classic example of a recursive formula. A sequence is defined by the recursive formula f (n + 1) = f(n) – 2. If we plug in f(1)= 18, then our answer will be: f(5)= 18-2= 16 The Fibonacci sequence is a classic example of a recursive formula.

#### FORMULA

A sequence is defined by the recursive formula f (n + l) = f(n) – w if we plug in f(l)= 18, then our answer will be: f(s)= 18-0= 16 Explanation: The Fibonacci sequence is a classic example of a recursive formula. If we plug in f (l) = 18, then our answer will be f (S) = I S – 0; so now that we know this information about the fifth number in the Fibonacci Sequence let’s look at another problem and calculate it out!

Let’s say you wanted to find out what the tenth number of the Fibonacci Sequence is; well you would do this by plugging in f (n) = 144. What is the tenth number in the Fibonacci sequence? f(l0)= 18-144= -136 This means that when we get to ten numbers, they will be negative! This also tells us that if we keep going up and say what’s 135 then 136 etc., it becomes more and more extreme as a result of these crazy negative values.

Now if someone were to ask about 137, 138 or 139–this would not work because those are already out into the negatives. So instead of trying your luck with guessing at how many digits there are before having an answer?

Hello , I am college Student and part time blogger . I think blogging and social media is good away to take Knowledge