2019
DOI: 10.3390/sym11050635
|View full text |Cite
|
Sign up to set email alerts
|

The Power Sums Involving Fibonacci Polynomials and Their Applications

Abstract: The Girard and Waring formula and mathematical induction are used to study a problem involving the sums of powers of Fibonacci polynomials in this paper, and we give it interesting divisible properties. As an application of our result, we also prove a generalized conclusion proposed by R. S. Melham.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…Name of sequence sums of second powers sums of third powers sums of powers Generalized Fibonacci [18,19,20,21,22,23] [ 24,25,26,27,28] [ 29,30,31] Generalized Tribonacci [32,33] Generalized Tetranacci [34,35] 2 AN APPLICATION OF THE…”
Section: Table 2 a Few Special Study On Sum Formulas Of Second Thirmentioning
confidence: 99%
“…Name of sequence sums of second powers sums of third powers sums of powers Generalized Fibonacci [18,19,20,21,22,23] [ 24,25,26,27,28] [ 29,30,31] Generalized Tribonacci [32,33] Generalized Tetranacci [34,35] 2 AN APPLICATION OF THE…”
Section: Table 2 a Few Special Study On Sum Formulas Of Second Thirmentioning
confidence: 99%
“…Let x be a complex number. For n 0 we have the following formulas: If ( s 3 x 2 + rsx + 1)(r 3 x + s 3 x 2 + 3rsx 1) 6 = 0 then (a):…”
Section: Sum Formulas Of Generalized Fibonacci Numbers With Positive mentioning
confidence: 99%
“…( s 3 x 2 + rsx + 1)(r3 x + s 3 x 2 + 3rsx 1)where 1 = x n+2 (s 3 x 2 + 2rsx 1)W 3 n+2 x n+1 (r 3 x + s 3 x 2 + 3r 2 s 2 x 2 r 3 s 3 x 3 + r 4 sx 2 + 2rsx 1)W 3 W 2 k W k+1 = 2 ( s 3 x 2 + rsx + 1)(r 3 x + s 3 x 2 + 3rsx 1) where 2 = rx n+2 (rsx 1) W 3 n+2 rs 3 x n+3 (rsx 1) W 3 n+1 + sx n+2 (2r 3 x s 3 x 2 + 1)W 2 n+2 Wn+1 x n+1 (r 3 x + s 3 x 2 + r 4 sx 2 2rs 4 x 3 + 2rsx 1)W 2 n+1 Wn+2 + rx (rsx 1) W 3 1 +rs 3 x 2 (rsx 1) W 3 0 sx(2r 3 x s 3 x 2 + 1)W 2 1 W0+(r 3 x + s 3 x 2 + r 4 sx 2 2rs 4 x…”
mentioning
confidence: 99%
“…Name of sequence sums of second powers sums of third powers sums of powers Generalized Fibonacci [10,11,12,13,14,15,16,17,18] [19,20,21,22,23,24,25] [ 26,27,28,29] Generalized Tribonacci [30,31,32] Generalized Tetranacci [33,34,35] 2 An Application of the Sum of the Squares of the Numbers…”
Section: Table 2 a Few Special Study On Sum Formulas Of Second Thirmentioning
confidence: 99%