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 vote354 views2 answers
How to send a byte array in socket java
Java
3 votes318 views1 answer
How to create textview programmatically in android
Java
0 vote317 views1 answer
Programa que convierete un archi de c a java
Java
1 vote346 views3 answers
Java check if dates are the same day
Java
0 vote311 views1 answer
Import android.support.v7.app.alertdialog androidx
Java
0 vote329 views1 answer
How to set credentials for speechClient Java google api
Java
10 votes291 views6 answers
Java Print
Java
22 votes320 views1 answer
How to exit a java program
Java
1 vote328 views1 answer
Java replace string case insensitive
Java
0 vote368 views1 answer
Spring security antmatchers id
Java Spring