Talk:Padovan polynomials

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:WikiProject banner shell

Untitled

At the moment the general recurrence given in this article is:

Pn(x)=xPn2(x)+Pn3(x)

which gives two Padovan polynomials with degree 2, two with degree 3 etc. Why is the recurrence not

Pn(x)=x2Pn2(x)+xPn3(x)

so that Pn(x) always has degree n-1, and there is a only one Padovan polynomial with a given degree ? This would be a closer analogue to Fibonacci polynomials. Gandalf61 11:21, August 26, 2005 (UTC)