1. Introduction

Mathematics can be considered as the underlying order of the universe, and the Fibonacci numbers is one of the most fascinating discovery made in the mathematical world. Among numerical sequences, the Fibonacci sequence has achieved a kind of celebrity status and has been studied extensively in number theory, applied mathematics, physics, computer science, and biology ^[2]. The Fibonacci numbers are famous for possessing wonderful and amazing properties. A similar interpretation also exists for Lucas sequence. The Fibonacci numbers have been studied both for their applications and the mathematical beauty of rich and interesting identities that they satisfy.

The Fibonacci sequence {f_n} of number F_n is defined by the recurrence relation

for,

(1.1)

Binet Formula for Fibonacci number is defined by

(1.2)

In 1883, catalan, E ^[2] was considered related set of polynomials which satisfies the recurrence relations.

The name Fibonacci polynomials is also given to the solution of the relation

(1.3)

With, investigated by Jacasthal, E ^[9]. Byrd, p.F ^[3] defined the Fibonacci polynomials by the recurrence relation.

(1.4)

with initial conditions

swamy, M.N.S ^[15] and Hoggatt, V.E. ^[9] almost simultaneously defined the Fibonacci polynomials by

(1.5)

with .

Here if we put x=1 in we get which if Fibonacci sequence.

Generating function of Fibonacci Polynomials is defined by

Hyper geometric form of generating function of Fibonacci polynomials is

Tribonacci number T_n ^[10] defined by

(1.6)

The Tribonacci numbers are (0, 1, 1, 2, 4, 7, 13, 24…).

The tribonacci polynomial t_n(x) ^[17] satisfies the following recurrence relation:

and t_o(x)=o, t₁(x)=1 t₂(x)=x².

In this chapter we present some identities of Tribonacci Polynomials by standard methods.

2. Tribonacci Polynomials

The Tribonacci polynomial t_n(x) ^[17] satisfies the following recurrence relation:

and t_o(x)=o, t₁(x)=1, t₂(x)=x²

The first few Tribonacci polynomials are as follows.

t₁(x) = 1

t₂(x) = x²

t₃(x) = x⁴ +x

t₄(x) = x⁶ +2x³+1

t₅(x) = x⁸ +3x⁵+3x²

t₆(x) = x¹⁰ +4x⁷+6x⁴ +2x

t₇(x) = x¹² +5x⁹+10x⁴ +7x³+1

t₈(x) = x¹⁴ +6x¹¹+15x⁸ +16x⁵+6x²…and so on.

Obviously, t_n (1) is Just the classical Tribonacci number T_n several basic properties its simple form the Tribonacci polynomials have many interesting properties.

The Generating function of Tribonacci polynomials is defined by

(2.1)

Now we will define the Hypergeometric form of generating function of Tribonacci polynomials. In this chapter we shall use following results.

(1)

(2)

(3)

(4)

3. Some Identities of Tribonacci Polynomials

Now we state and prove some Identities of Tribonacci polynomials theorem.

Theorem (3.1).

Proof. we know that the generating function of Tribonacci polynomials is

Theorem (3.2). recurrence relations by the generating function of Tribonacci polynomials we can easily get following recurrence relations.

and

Proof. The generating function of Tribonacci polynomials is

Differentiating (2.1) w.r. to we get

Equating the coefficient of tⁿ⁺¹and tⁿ, we get

and

Theorem (3.3). Prove that and .

Proof.

The Generating function of Tribonacci Polynomials

Put x=0 in eqⁿ (2.1) we get

Equating the coefficients of and on both sides respectively, we get

Theorem (3.4).Prove that

Proof . Differentiating equation (2.1) w.r.t ‘x', we get

Put x=o, we get

on both side respectively, we get

4. Conclusion

In this paper, we introduce some identities Tribonacci polynomials by standard techniques. Some basic identities are obtained by method of generating function. Also some identities are obtained in hyper geometric form.

Acknowledgement

The authors would like to thanks the anonymous referee for carefully reading the paper and for their comments.

References

[1]	Biknell, M Hoggatt, V.E. Jr. Generalized Fibonacci, Polynomials Fibonacci Q.016, 300-303 (1978).
	In article
[2]	Burrage, K generalized Fibonacci polynomials and the functional iteration of Rational Function of degree one Fibonacci Q.28, 175-180 (1990).
	In article
[3]	Byrd, P.F. Expansion of Analytic Functions In polynomials associated with Fibenacci Numbers, the Fibonacci, quarterly, 1(1), (1963), 16-29.
	In article
[4]	Catalon, E., Notes surla Theoric des Fractions continuous sur certain series, mem. Acad. R Belgique, 45, (1883) 1-82.
	In article
[5]	Dilcher, K.A generalization of Fibonacci polynomials of integer order Fibonacci Q.16, 300-303 (1978).
	In article
[6]	Djordjevi´c, G. B. and Srivastava, H. M., Some generalizations of certain sequences associated with the Fibonacci numbers, J. Indonesian Math. Soc. 12 (2006) 99-112.
	In article
[7]	Djordjevi´c, G. B. and Srivastava, H. M., Some generalizations of the incomplete Fibonacci and the incomplete Lucas polynomials, Adv. Stud. Contemp. Math. 11 (2005) 11-32.
	In article
[8]	He, m.x, Ricci, P.E. Asymptotic distribution of zero of weighted fibonacci polynomials, complex var. 28, 375-384 (1996).
	In article
[9]	Hoggatt, V. E., Jr.: Bicknell, Marjporie (1973), “Roots of Fibonacci, Macmillan, New York (1960).
	In article
[10]	Jacosthal, E, Fibonacci Polynomial and kreisteil ungsgleichugen sitzugaberichteder Berlinear, math gesells chaft, 17 (1919), 43-57.
	In article
[11]	Koshy, T. Fibonacci Lucas numbers with application (willey, New York, (2001).
	In article
[12]	Lucy, Joan slater “Generalized Hypergeometric functions” Cambridge University press (1966).
	In article
[13]	Patel. J.M. Advanced problems and solutions, the Fibonacci quarterly, 44(1) (2006) 91.
	In article
[14]	Srivastava, H. M. and. Manocha, H. L, A Treatise on Generating Functions, Halsted Press (Ellis Horwood Limited, Chichester), John Wiley and Sons, New York, Chichester, Brisbane and Toronto, 1984.
	In article
[15]	Swami, M.N.S. problem B-74, The fibonacci Quarterly, 3, (1965), 236. Solution by David Zeitlin, the Fibonacci quarterly, 4(1) (1966), 94.
	In article
[16]	Vorobyou, N.N. The Fibonacci numbers D.C. Health Company, Boston (1963).
	In article
[17]	W.Goh, M.x. He, P.E. Ricci, on the universal zero attrattor of the Tribonacci- Related Polynomials, (2009).
	In article
[18]	Yogesh Kumar Gupta, V. H. Badshah, Mamta Singh, and Kiran Sisodiya, Generalized Additive Coupled Fibonacci Sequences of Third order and Some Identities, International Journal of Innovative Science, Engineering & Technology, Vol. 2 Issue 3, March 2015, 80-85.
	In article
[19]	Yogesh Kumar Gupta, Kiran Sisodiya, Mamta Singh, and Generalization of Fibonacci Sequence and Related Properties, “Research Journal of Computation and Mathematics, Vol. 3, No. 2, (2015), 12-18.
	In article
[20]	Yogesh Kumar Gupta, V. H. Badshah, Mamta Singh, and Kiran Sisodiya, “Diagonal Function of k-Lucas Polynomials.” Turkish Journal of Analysis and Number Theory, vol. 3, no. 2 (2015): 49-52.
	In article		View Article