Question

Exercise: F(n)= F(n-1) + F(n-2) where: F(0)=0 F(1)=1 How do you make this exercise with all...

Exercise:

F(n)= F(n-1) + F(n-2)

where:

F(0)=0

F(1)=1

How do you make this exercise with all constants expressed?

Homework Answers

Answer #1

Answer:-

we can find the sequence as follows:

f(0)=0,f(1)=1

if we put n=2 in the equation then,

f(2)=f(1)+f(0)=1+0=1

similarly,

f(3)=f(2)+f(1)=1+1=2

f(4)=f(3)+f(2)=2+1=3

f(5)=f(4)+f(3)=3+2=5

so,from this we can see that here the present number is sum of previous two numbers of the sequence.

So,the sequence is

0,1,1,2,3,5,8,13,21,34............

This sequence is also known as fibonacci series.

NOTE::- If you have any doubt please write down in the comment box and if the answer helps please give a like.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Design & Analysis of Algorithimns Resolve these 1) F(n) = F(n-1) + F(n-2) where: F(0) =...
Design & Analysis of Algorithimns Resolve these 1) F(n) = F(n-1) + F(n-2) where: F(0) = 0 F(1) = 1 2) t(n) = 6t(n-1)+4t(n-2) where: t(0)=0 t(1)=4sqrt
How to solve this equation to find f(n), where f(n)=1+p*f(n+1)+q*f(n-1). p,q are constant and p+q=1. We...
How to solve this equation to find f(n), where f(n)=1+p*f(n+1)+q*f(n-1). p,q are constant and p+q=1. We already know two point f(0)=f(d)=0, d is a constant number. what is f(n) as a function with p,q,d,n?
Exercise 1. Suppose (a_n) is a sequence and f : N --> N is a bijection....
Exercise 1. Suppose (a_n) is a sequence and f : N --> N is a bijection. Let (b_n) be the sequence where b_n = a_f(n) for all n contained in N. Prove that if a_n converges to L, then b_n also converges to L.
How do you make a plot of the transition frequency versus (1/2^2 -1/n^2 ) for helium...
How do you make a plot of the transition frequency versus (1/2^2 -1/n^2 ) for helium and then Determine figure out the Zeff. what is the transition frequency?
Give a recursive algorithm to solve the following recursive function.    f(0) = 0;    f(1)...
Give a recursive algorithm to solve the following recursive function.    f(0) = 0;    f(1) = 1; f(2) = 4; f(n) = 2 f(n-1) - f(n-2) + 2; n > 2 Solve f(n) as a function of n using the methodology used in class for Homogenous Equations. Must solve for the constants as well as the initial conditions are given.
Consider a function (fx) such that L(f)(2) = 1; f(0)=1; f'(0)=0 Where L(f)(s) denotes the Laplace...
Consider a function (fx) such that L(f)(2) = 1; f(0)=1; f'(0)=0 Where L(f)(s) denotes the Laplace transform of f(t) Calculate L(f'')(2)
1. Find the radius of convergence for: ∞∑n=1 (−1)^n x^n / √n+9 2. If f(x)=∞∑n=0 n...
1. Find the radius of convergence for: ∞∑n=1 (−1)^n x^n / √n+9 2. If f(x)=∞∑n=0 n /n^2+1 x^n and g(x)=∞∑n=0 (−1)^n n /n^2+1 x^n, find the power series of 1/2(f(x)+g(x)). ∞∑n=0 =
Exercise 1. Prove that floor[n/2]ceiling[n/2] = floor[n2/4], for all integers n.
Exercise 1. Prove that floor[n/2]ceiling[n/2] = floor[n2/4], for all integers n.
Given x(n) = {-1, 0, 2, 3}; where x(n=0) = -1                                   &nbsp
Given x(n) = {-1, 0, 2, 3}; where x(n=0) = -1                                                                  ­ a) compute its Discrete Time Fourier Transform X(ejw) b) sample X(ejw) at kw1 = 2?k/4, k = 0,1,2,3 and show that is equal to X~(k) which is the Discrete Fourier Series (DFS) of x~(n)
Find the Fourier Transform of the following, Show all steps: 1- f(x)=e^(-6x^2) 2- f(x) is 0...
Find the Fourier Transform of the following, Show all steps: 1- f(x)=e^(-6x^2) 2- f(x) is 0 for all x except 0≤x≤2 where f(x)=4
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT