F(n) is defined as a sequence of positive integers such that F(0) = 0, F(1) = 1, and everything else is determined by the following recurrence relation: F(n) = F(n-1) + F(n-2) Prove that \[F(n) \leq \phi^{n-1}\]where\[\phi = \frac{1+\sqrt{5}}{2}\]
oh and use induction :-D
are you answering questions for other people or something?
no these are from the text
what text
Inductive prove are highly un-intuitive in my opinion.
http://www.amazon.com/Computer-Programming-Volumes-1-4A-Boxed/dp/0321751043/ref=dp_ob_title_bk
last night you were asking about 3 different C programs, a python program that you'd copied off the web and didn't understand, Pascal's wager, and a bunch of optimization questions. i'm trying to figure out what's going on, are you doing other people's homework or something?
agd .. without meaning any offence I would like to point out that you may be jumping around many subject very quickly and this may be not be good .. and might lead to cognitive overflow .. happened to me once so I know it sucks!
I think induction is suited for this question.
hmm right...
if I don't take care of myself, tomorrow you might find me asking Bio questions here :-P
hehe, what do you study ?
what school are you at?
:(
what happen .. why are you sad ?
okay how much have you studied ? What do you want to study in future ?
I wanna study medicine!
i don't understand why you're being so evasive... you said you were working with professors at a university yesterday. which one?
a few, but often with the humanities, or whatever you call the department the professors who give classes writing assignments are in.
i mean which university
binet's formula try here http://fabulousfibonacci.com/portal/index.php?option=com_content&view=article&id=22&Itemid=22 or here http://fabulousfibonacci.com/portal/index.php?option=com_content&view=article&id=22&Itemid=22 or here http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibformproof.html
Join our real-time social learning platform and learn together with your friends!