This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
Untitled
editAt the moment the general recurrence given in this article is:
which gives two Padovan polynomials with degree 2, two with degree 3 etc. Why is the recurrence not
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)