We are creating the world's most trusted encyclopedia and knowledge base.
Once you join us and log in, you'll be able to edit this page instantly!

Fibonacci polynomials

From Citizendium, the Citizens' Compendium

Jump to: navigation, search
Image:Statusbar2.png
Main Article
Talk
Definition [?]
Related Articles  [?]
Bibliography  [?]
External Links  [?]
 
This is a draft article, under development. These unapproved articles are subject to a disclaimer.

In mathematics, Fibonacci polynomials are a generalization of Fibonacci numbers. These polynomials are defined by:

F_n(x)=\left\{\begin{matrix} 1,\qquad\qquad\qquad\qquad&\mbox{if }n=1\\ x,\qquad\qquad\qquad\qquad&\mbox{if }n=2\\ xF_{n-1}(x)+F_{n-2}(x),&\mbox{if }n\ge3 \end{matrix}\right.

The first few Fibonacci polynomials are:

F_1(x)=1 \,
F_2(x)=x \,
F_3(x)=x^2+1 \,
F_4(x)=x^3+2x \,
F_5(x)=x^4+3x^2+1 \,
F_6(x)=x^5+4x^3+3x \,

The Fibonacci numbers are recovered by evaluating the polynomials at x = 1.

See also



Some content on this page may previously have appeared on Wikipedia.

Retrieved from "http://en.citizendium.org/wiki/Fibonacci_polynomials"
Views
Personal tools