Ask Experts Questions for FREE Help!
Answer   ||    Advanced Search

Ask your question or search...
International Sites: Nederlandse experts vragen
User Name 
Password 
Join   Forgot password? 

Home > Education > Homework Help > Math & Sciences   »   Recursive function: Proof by induction:

Question
 
 
#1  
Old Nov 3, 2009, 02:03 PM
klbcooldude
New Member
klbcooldude is offline
 
Join Date: Oct 2009
Posts: 5
klbcooldude See this member's comment history on his/her Profile page.
Recursive function: Proof by induction:

Hey I'm looking for some help on these questions, I don't know where to begin.

Base Case: F(0) = 0; F(1) = 1.
Recursive Step: F(n) = F(n-1) + F(n-2) for all n ≥ 2.

(a) Prove by induction that F(n)≤((1+√5)/2)^(n-1)

(b) Prove by induction that F(n)≥(1.5)^(n-1)

thanks

Reply With Quote
 
     


Your Answer
Email me when someone replies to my answer
Join Login



Thread Tools Search this Thread
Search this Thread:

Advanced Search
Display Modes
Ask your question or search...



Similar Threads
proof by induction
(2 replies)
Proof by induction
(1 replies)
proof by induction
(6 replies)
Proof by induction
(2 replies)
Proof by Induction
(3 replies)

Thread Tools
Show Printable Version Show Printable Version
Email this Page Email this Page
Search this Thread

Advanced Search

Bookmarks





Copyright ©2003 - 2009, Ask Me Help Desk.
All times are GMT -8. The time now is 06:42 PM.