Some Identities Involving Fibonacci Polynomials and Fibonacci Numbers

The aim of this paper is to research the structural properties of the Fibonacci polynomials and Fibonacci numbers and obtain some identities. To achieve this purpose, we first introduce a new second-order nonlinear recursive sequence. Then, we obtain our main results by using this new sequence, the properties of the power series, and the combinatorial methods.


Introduction
For any real number x, the Fibonacci polynomials F n (x) are defined by F 0 (x) = 1, F 1 (x) = x, F 2 (x) = x 2 + 1, F 3 (x) = x 3 + 2x, F 4 (x) = x 4 + 3x 2 + 1, and the second order linear recursive formula: If x = 1, then F n (1) = F n+1 is the famous Fibonacci sequence.Its initial values are The general expression of F n (x) is: The generating function of the Fibonacci polynomials F n (x) is: These polynomials play a very important role in the theory and application of mathematics.Because of this, many number theory experts study the properties of F n (x) and F n and obtain a series of important results.For example, Yuan Yi and Wenpeng Zhang [1] studied the computational problem of the summation: where the summation is taken over all (h + 1)-dimension nonnegative integer coordinates They used the elementary and combination methods to give a meaningful identity involving F n (x) and its derivative F n (x).
Zhengang Wu and Wenpeng Zhang [2,3] studied the calculation problem of the reciprocal sum of the Fibonacci numbers and Fibonacci polynomials and obtained many interesting identities and calculation formulae.
Very recently, Yixue Zhang and Zhuoyu Chen [19] used the elementary method and combination skill to research the calculating problem of one kind sums of the second kind Chebyshev polynomials and then obtained a very interesting identity.
This paper is inspired by [19].As a note of [1,4], we are going to introduce a new second order non-linear recursive sequence, then use this sequence to acquire a meaningful expression for (2).That is, we shall prove the following: Theorem 1.Let h be a positive integer.Then, for any integer n ≥ 0, we have the identity: where S(h, i) is a second order non-linear recurrence sequence defined by S(h, 0) = 0, S(h, h) = 1, and S(h In particular, taking n = 0 and x = 1, we can also deduce the following corollaries from Theorem 1.

Corollary 1.
For any positive integer h ≥ 1, we have the identity: Corollary 2. For any positive integer h ≥ 1, we have the identity: The formula in Corollary 1 profoundly reveals the close relationship among the Fibonacci polynomials.Taking h = 2, then from Theorem 1, we can also infer the following: Corollary 3.For any integer n ≥ 0, we obtain: To further comprehend the properties of the sequence S(h, i), here we give first several terms of S(h, i) in the following Table 1: By observing this table, we can easily find that for primes p = 2, 3, 5, 7, we have the congruences S(p, i) ≡ 0 mod p(p − 1) for 0 ≤ i ≤ p − 1.In fact, this conclusion is also correct for all primes p.That is, we obtain the following: Theorem 2. Let p be a prime.Then, for any integer i with 1 ≤ i ≤ p − 1, we acquire the congruence: S(p, i) ≡ 0 mod p(p − 1).

Several Simple Lemmas
In this part, we will give several necessary lemmas in the proof process of our theorems.First of all, we have the following: Then, for any positive integer n and real numbers x and t with |2t| < |x|, we have the identity: where S(n, i) is defined in the theorem and f (h) (t) indicates the h-order derivative of f (t) with respect to variable t.
Proof.In fact, we can prove this Lemma 1 by mathematical induction.By the properties of the derivative, we have: or: That is, Lemma 1 is true for n = 1.Assuming Lemma 1 holds for 1 ≤ n = h, we have, Next, from (3) and the definitions of S(k, i) and the derivative, we obtain: Thus, from (4), we deduce that: That is to say, Lemma 1 also applies for n = h + 1.Now, Lemma 1 follows from the mathematical induction.
Lemma 2. For any positive integers h and k, we have the power series expansion: where t and x are any real numbers with |t| < |x|.
Proof.In fact, from the definition of the Fibonacci polynomials F n (x), we have: For any positive integer h, from the properties of the power series, we can obtain: Let k be a positive integer.Then, for all real t and x with |2t| < |x|, noting that the power series expansion: we have: Applying ( 5), ( 6), and the multiplicative properties of the power series, we have: This proves Lemma 2.

Proofs of the Theorems
In this section, the proofs of our theorems will be completed.Firstly, we prove Theorem 1.For any positive integer h, from (1), Lemma 1, the definition of f (t), and the properties of the power series, we have: On the other hand, applying Lemma 2, we also have: Combined with ( 7), (8), and Lemma 1 and compared with the coefficients of the power series, we may immediately deduce the identity: This proves Theorem 1. Now, we use the mathematical induction to prove Theorem 2. Taking h = p in Corollary 1, we have: or from (1), we have: For convenience, we let: (−1) p−j • S(p, j) • j! • x j • F j (x) and: Then, from the definition of the derivative, we have: and: Combining ( 9), (10), and (11), we have: S(p, p − 1) = p(p − 1) ≡ 0 mod p(p − 1).