Generalization of Numerical Series and its Relationship with the Polynomial Equations and Artithmetic Trapezoids
Abstract
The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation xk + n = Σj = 0n-1αj xk + j, where n is the polynomial degree and α's, the polynomial coefficients. The arithmetic trapezoid resulting from the recurrence equations is also shown. This trapezoid is nothing but a generalization of Pascal's Triangle. Trapezoid is a convenient name because the form it appears does not have the `upper end` of a usual triangle. This study shows that each polynomial generates infinite sequences, and that each sequence generates only a single arithmetic trapezoid.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.