As shown in the model below, there are three lines.
it's the only one that hasn't been with a positive 2
I hope this helps you
Where's the question?
Answer:
f(n)=f(n-1)+f(n-2)
f(1)=1x
f(2)=1x
Step-by-step explanation:
This is the fibonacci sequence with each term times x.
Notice, you are adding the previous two terms to get the third term per consecutive triples of the sequence.
That is:
1x+1x=2x
1x+2x=3x
2x+3x=5x
3x+5x=8x
So since we need the two terms before the third per each consecutive triple in the sequence, our recursive definition must include two terms of the sequence. People normally go with the first two.
f(1)=1x since first term of f is 1x
f(2)=1x since second term of f is 1x
Yes, I'm naming the sequence f.
So I said a third term in a consecutive triple of the sequence is equal to the sum of it's two prior terms. Example, f(3)=f(2)+f(1) and f(4)=f(3)+f(2) and so on...
Note, the term before the nth term is the (n-1)th term and the term before the (n-1)th term is the (n-2)th term. Just like before the 15th term you have the (15-1)th term and before that one you have the (15-2)th term. That example simplified means before the 15th term you have the 14th and then the 13th.
So in general f(n)=f(n-1)+f(n-2).
So the full recursive definition is:
f(n)=f(n-1)+f(n-2)
f(1)=1x
f(2)=1x
Answer:
1/59049
Step-by-step explanation:
