February 22nd, 2017, 05:32 PM  #11 
Newbie Joined: Aug 2015 From: china Posts: 6 Thanks: 4 
In fact, it is a recursive problem. Known $\displaystyle f(0)=1,f(1)=1,f(n)=f(n1)+f(n2)$ One obtains $\displaystyle f(n)=(\frac{\sqrt{5}+1}{2})^n+(\frac{\sqrt{5}1}{2})^n$ Similarly Known $\displaystyle f(0)=2,f(1)=6,f(n)=3f(n1)f(n2)$ One obtains $\displaystyle f(n)=(\frac{3+\sqrt{5}}{2})^n+(\frac{3\sqrt{5}}{2})^n=(\frac{\sqrt{5}+1}{2})^{2n}+(\frac {\sqrt{5}1}{2})^{2n}$ 

Tags 
show 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Show that  fahad nasir  Trigonometry  2  October 2nd, 2016 09:51 AM 
How to show?  jiasyuen  Calculus  12  January 25th, 2015 02:47 AM 
want to show that show that two infinite summations R equal  notnaeem  Real Analysis  4  August 16th, 2010 01:32 PM 
show that :  naserellid  Algebra  2  August 15th, 2010 03:20 AM 
Show that fog is onetoone  450081592  Calculus  2  January 25th, 2010 10:38 AM 