chaotic nspace network  fractals  cge  software  philosophy  math  books home 
Note: you need the symbol font to view this page correctly. If you can see a red, root symbol here Ö , you have it installed already. Well, I guess it is about time I posted something to this section. I have not had anything really worthwhile to post and this probably doesn't qualify but hey! At least there is something here now. Fibonacci Numbers Let's start off by refeshing our memories regarding the fibonacci sequence. The fibonacci sequence is defined as: Fn = Fn1 + Fn2 with F0 = 0 and F1 = 1 Thus, the fibonacci sequence looks like this: 0, 1, 1, 2, 3, 5, 8, 13, 21,... With each being the sum of its two predecessors. It is interesting to note that the ratio of two succesive fibonacci numbers approach the golden ratio: (1 + Ö5)/2 @ 1.618 lim Fn/Fn1
= (1 + Ö5)/2 There are several methods for computing the nth fibonacci number. This one was discovered by A. de Moivre in 1718 and proved ten years later by Nicolas Bernoulli: Fn = [((1 + Ö5)/2)^n  ((1  Ö5)/2)^n]/Ö5 More tomorow when I return. Resources: 1. Schroeder, M. R., Number Theory in Science and Communication. SpringerVerlag: New York, 1997. maintained by jcamp@cnspace.net 

Copyright
1999 chaotic
nspace network 