Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Scalable Fibonacci Solutions

Name: Anonymous 2011-10-03 18:50

Name: Anonymous 2011-10-03 23:15


(f_n)^2 + (f_(n+1))^2 = f_(2n+1)


will give you the odd term ones, and then you can use:


f_(2n) = f_(2n+1) - f_(2n-1)


to get the even ones.

[code]
f_(2(n+1)+1) = f_(2n+3)
             = f_(2n+2) + f_(2n+1)
             = f_(2n+1) + f_(2n) + f_(2n+1)
             = 2f_(2n+1) + f_(2n)
             = 2f_(2n+1) + f_(2n+1) - f_(2n-1)
             = 3f_(2n+1) - f_(2(n-1)+1)
             = 3[(f_n)^2 + (f_(n+1))^2] - [(f_(n-1))^2 + (f_n)^2]   Using Strong induction..
             = 3(f_n)^2 + 3(f_(n+1))^2 - (f_(n-1))^2 - (f_n)^2
             = 2(f_n)^2 + 3(f_(n+1))^2 - (f_(n-1))^2
             = 2(f_n)^2 + 3(f_(n+1))^2 - (f_(n+1) - f_n)^2
             = 2(f_n)^2 + 3(f_(n+1))^2 - ((f_(n+1))^2 - 2f_(n+1)f_n + (f_n)^2)
             = 2(f_n)^2 + 3(f_(n+1))^2 - (f_(n+1))^2 + 2f_(n+1)f_n - (f_n)^2
             = (f_n)^2 + 2(f_(n+1))^2 + 2f_(n+1)f_n
             = (f_(n+1))^2 + (f_n)^2 + 2(f_n)f_(n+1) + (f_(n+1))^2
             = (f_(n+1))^2 + (f_n + f_(n+1))^2
             = (f_(n+1))^2 + (f_(n+2))^2

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List