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

0 vote107 views1 answer
Multiple recyclerview not scrolling bottom sheet
Java
0 vote117 views1 answer
Java in terminal
Java
1 vote118 views1 answer
Hashmap sort ascending
Java
0 vote128 views1 answer
Java opts
Java
-2 votes128 views1 answer
Style jbuttons
Java
7 votes119 views3 answers
Java wait 2 seconds
Java
0 vote133 views1 answer
Swagger apiimplicitparam all endpoints
Java
8 votes130 views3 answers
Java delay
Java
3 votes117 views2 answers
Java unique id
Java
1 vote175 views1 answer
Do while jaca
Java