Fibonacci of 6

f(n) = f(n-1) + f(n-2) 
                                  f(6)
                                   ^
  			                       /\
                f(5)               +                       f(4)
                ^
               /\                   +                        /\
                
        f(4)    +           f(3)                     f(3)    +    f(2)
       ^                       ^                     ^              ^
      /\                       /\                    /\            /\
   
 f(3)   +       f(2)            f(2) + f(1)       f(2) + f(1)   f(1) +  f(0)             
   ^              ^                ^                ^
   /\             /\                /\              /\
    
f(2) + f(1)      f(1) +  f(0)     f(1)+ f(0)       f(1) + f(0)         
  ^
  /\
f(1) +  f(0) 
  
//f(6) = 8   ==>  f(1)*8    f(1) appears 8 times 
 double feb  = (1/Math.pow(5,0.5)) * (Math.pow((1+Math.pow(5,0.5))/2,n)) - (1/Math.pow(5,0.5))* (Math.pow((1-Math.pow(5,0.5))/2,n));  
  
f(1) == 1;

Similar codes

-1 vote308 views1 answer
Quit button java swing
Java
0 vote298 views1 answer
AccountDriver.java
Java
3 votes309 views2 answers
Spring boot example with swagger
Java
1 vote321 views3 answers
Dates in java 8
Java
35 votes278 views6 answers
Check java version
Java
0 vote316 views1 answer
Mockito verify not called
Java
0 vote288 views10 answers
Bruh
Java
1 vote295 views1 answer
Java swing absolute position
Java
6 votes285 views4 answers
Sort 2d array based on one column java
Java
1 vote298 views1 answer
Base64.decode android
Java