Preprint
Article

This version is not peer-reviewed.

Finite and Infinite Sums Involving Reciprocals of Products of Gibonacci Numbers

Submitted:

06 September 2025

Posted:

09 September 2025

You are already at the latest version

Abstract
We prove many identities involving sums with products of Gibonacci numbers in the denominator. Three of our results provide generalizations of problems published in The Fibonacci Quarterly. We also study Brousseau sums with Gibonacci entries.
Keywords: 
;  ;  ;  ;  

1. Motivation and Preliminaries

Sums and series of reciprocals of recurrence sequences is a topic of great interest in recent research articles. In [13] the authors consider a very general sums of the form
n = 0 m 1 B f ( n ) u Δ f ( n ) w f ( n ) w f ( n + 1 ) ,
where w n is an arbitrary second order recurrence sequence (Horadam sequence), B is some parameter related to that sequence and Δ is the difference operator. In the paper from 2023, Adegoke et al. [3] study three-parameter sums and series of the form
i = 1 N q m ( i k ) w m ( i k ) + n w m ( i + k ) + n a n d i = 1 N q m ( 2 i k ) w m ( 2 i k ) w m ( 2 i + k ) ,
where q is a parameter, and m , n and k are integers. Similar sums are the subject of interest in [1,9,10,14]. Extraordinary work on reciprocal sums with three and more (generalized) Fibonacci factors has been done by Melham. In a series of papers starting in 2000 he gives closed forms for many types of these sums (see [15,16,17,18,19,20,21,22]). But their history can be tracked back further to André-Jeannin [4], Melham and Shannon [23], Rabinowitz [28] and even to Hoggart and Bicknell [11], Bruckman and Good [8] and Brother Brousseau back in 1967.
Brousseau in his articles [6,7] initiated a trend that is currently named after him “Brousseau sums” and is related to finding various sums with inverses of Fibonacci-like numbers and their (weighted) products. In particular, Brousseau applied a telescoping summation method (referenced in this article as (T1)) in [7] to obtain many Fibonacci and Lucas identities, which are, among others:
k = 1 F k F k + 1 F k + 2 = 1 , k = 1 F k + 1 F k F k + 3 = 5 4 , k = 1 F 4 k + 3 F 2 k F 2 k + 1 F 2 k + 2 F 2 k + 3 = 1 2 , k = 1 F 2 k + 5 F k F k + 1 F k + 2 F k + 3 F k + 4 F k + 5 = 1 15 .
For example, the first identity on the right hand side is a consequence of the following relation:
1 F n 1 F n + 3 = F n + 3 F n F n F n + 3 = 2 F n + 1 F n F n + 3 ,
and thus applying the telescoping principle we arrive at
k = 1 F n + 1 F n F n + 3 = 1 2 1 F 1 + 1 F 2 + 1 F 3 = 5 4 .
Notice that the only place where initial values matter is at the very end of the computation, therefore the reasoning can be easily generalized to any Gibonacci sequence. This idea will be heavily used in our article.
The idea for writing this article has a second source of motivation. In the section Advanced Problems and Solutions of the journal The Fibonacci Quarterly Ohtsuka [25] challenges the readers to show that
k = 1 1 F k F k + 4 1 F k + 1 + 1 F k + 2 1 F k + 3 = 1 3 ,
k = 1 ( 1 ) k F k F k + 4 1 F k + 1 + 1 F k + 2 1 F k + 3 = 1 6 ,
k = 1 1 F k F k + 1 F k + 2 F k + 3 F k + 4 1 F k + 1 + 1 F k + 2 1 F k + 3 = 1 24 .
The problem was solved by Bataille [5] (among others). A Lucas version of the problem also exists [27]:
k = 1 3 L k L k + 4 1 L k + 1 + 1 L k + 2 1 L k + 3 = 1 7 ,
k = 1 ( 1 ) k 3 L k L k + 4 1 L k + 1 + 1 L k + 2 1 L k + 3 = 3 28 ,
k = 1 3 L k L k + 1 L k + 2 L k + 3 L k + 4 1 L k + 1 + 1 L k + 2 1 L k + 3 = 1 672 .
As it turns out, these sums can be easily generalized to the Gibonacci sequence as well and furthermore, these identities have given rise to a search for similar identities. In addition, we have found other problem proposals that allow for such generalizations.
In the next sections, we find the aforementioned identities, but we also go back to some classic problems, such as summation of
k = 1 1 G k G k + m
considered by André-Jeannin [4], and later generalized by Melham and Shannon [23] and Melham [18,19,22].
Throughout the article we use the standard notation for the Fibonacci numbers F n , the Lucas numbers L n and the Gibonacci numbers G n . Recall that the Gibonacci sequences has the same recurrence relation as the Fibonacci sequence but starts with arbitrary initial values, i.e.,
G k = G k 1 + G k 2 , ( k 2 ) ,
with G 0 and G 1 arbitrary numbers (usually integers) not both zero. When G 0 = 0 and G 1 = 1 then G n = F n , and when G 0 = 2 and G 1 = 1 then G n = L n , respectively. The sequence obeys the generalized Binet formula
G n = A α n + B β n ,
where α = 1 + 5 2 , β = 1 5 2 are the roots of the characteristic equation x 2 = x + 1 , and A = G 1 G 0 β α β and B = G 0 α G 1 α β . To avoid indeterminates, we assume that G n 0 for all n.
We recall the following following classic telescoping summation formulas:
j = 1 n ( f j + 1 f j ) = f n + 1 f n , j = 1 n ( 1 ) j 1 ( f j + 1 + f j ) = ( 1 ) n + 1 f n + 1 + f 1 , j = 1 n d n j c j 1 ( c f j + 1 d f j ) = c n f n + 1 d n f 1 ,
where we assume that f j , d and c are real numbers with c d 0 . Throughout the article, we will mainly use (T1) and a variation of (T3).
We note that the range of summation in our article is from k = 1 . This is just a cosmetic choice and any formula obtained for the Gibonacci sequence in range from k = 1 can be adjusted accordingly to any other range from k = where is any non-negative integer.

1.1. Gibonacci identities

We conclude with a collection of Gibonacci identities which will be used later in various forms. Two classical identities for Gibonacci numbers are
G k + m = F m G k + 1 + F m 1 G k , G k m = ( 1 ) m ( F m + 1 G k F m G k + 1 ) .
The first identity is Equation (8) in Vajda’s book [29]. Two other general identities from Vajda’s book are
G k + m + ( 1 ) m G k m = L m G k , G k + m ( 1 ) m G k m = F m ( G k 1 + G k + 1 ) ,
which are Equations (10a) and (10b), respectively. These can be turned into identities involving fractions:
( 1 ) r G k + 2 r + 1 G k = L r G k + r G k G k + 2 r ,
1 G k F r 1 G k + r = F r G k + 1 G k G k + r .
The first one is a restatement of Equation (10a) in Vajda’s book, which we include for further reference:
G k + 2 m + ( 1 ) m G k = L m G k + m ,
while the second one is a restatement of (7). We also have a special case of (8): for odd m we have
G k + 2 m = F m ( G k + m 1 + G k + m + 1 ) ) G k .
If we now change indices in (11) and rearrange, we get
G n k = L n G n k n + ( 1 ) n + 1 G n k 2 n .
An identity of Howard [12] can be written as
F m r G k + r ( 1 ) r F m G k = ( 1 ) r 1 F r G k + m G k G k + r .
Still another classical identity, the Catalan identity, reads as
G k r G k + r G k 2 = ( 1 ) k r ( G 0 G 2 G 1 2 ) F r 2 , r 0 ,
of which the Cassini identity
G k 1 G k + 1 G k 2 = ( 1 ) k + 1 ( G 0 G 2 G 1 2 )
is a special case.
Finally, we note the following limit properties.
Lemma 1.
If m is a non-negative integer, then
lim k G k G k + m = 1 α m = ( 1 ) m β m = ( 1 ) m ( β F m + F m 1 )
and
lim k F k G k + m = 1 ( G 1 G 0 β ) α m = ( 1 ) m 1 ε G ( G m + 1 α G m ) ,
where here and throughout this paper ε G = G 0 2 G 1 2 + G 1 G 0 .
Proof. 
These results are consequences of the Binet formula. Note that in obtaining the second equality in (16), we used
1 α m = ( 1 ) m β m = ( 1 ) m ( β F m + F m 1 )
and (7). □
For convenience and to shorten the formulas, we will commonly write G k G k + n instead of G k · G k + 1 G k + n .

2. The Generalization of (1)–(6) and Other Identities

Our first set of results is the direct generalization of the identities (1)–(6) to the Gibonacci case. Thus, we shall utilize elementary identities. A general approach or the structure of some identities will be discussed in the next section.
Theorem 1.
We have
k = 1 1 G k G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = 1 G 1 G 2 G 4 .
Proof. 
Notice that
G k + 3 ( G k + 3 + G k ) = G k + 3 · 2 G k + 2 = G k + 2 ( G k + 1 + G k + 4 ) ,
so
G k + 3 2 G k + 1 G k + 2 = G k + 2 G k + 4 G k G k + 3
and thus
1 G k G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = 1 G k G k + 4 · G k + 3 2 G k + 1 G k + 2 G k + 1 G k + 2 G k + 3 = G k + 2 G k + 4 G k G k + 3 G k G k + 4 = 1 G k G k + 1 G k + 3 1 G k + 1 G k + 2 G k + 4 .
Hence the desired sum telescopes and we have via (T1)
lim n 1 G 1 G 2 G 4 1 G n + 1 G n + 2 G n + 4 = 1 G 1 G 2 G 4 ,
which gives (17). □
The next result is the following alternating version of (17).
Theorem 2.
We have
k = 1 ( 1 ) k G k G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = 1 G 1 2 G 0 G 2 G 3 G 1 G 4 1 G 3 1 G 4 .
Proof. 
We use the computation used to prove (17) and the Cassini identity for the Gibonacci numbers (15). This implies
( 1 ) k G k G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = ( 1 ) k G k G k + 1 G k + 3 + ( 1 ) k + 1 G k + 1 G k + 2 G k + 4 = 1 G 1 2 G 0 G 2 G k + 1 G k + 3 G k + 2 2 G k G k + 1 G k + 3 + G k + 2 G k + 4 G k + 3 2 G k + 1 G k + 2 G k + 4 = 1 G 1 2 G 0 G 2 1 G k G k + 2 2 G k G k + 1 G k + 3 + 1 G k + 1 G k + 3 2 G k + 1 G k + 2 G k + 4 = 1 G 1 2 G 0 G 2 G k + 2 G k G k + 1 G k + 2 2 G k G k + 1 G k + 3 G k + 3 2 G k + 1 G k + 2 G k + 4 = 1 G 1 2 G 0 G 2 G k + 2 G k + 3 G k + 2 2 G k G k + 1 G k + 3 G k + 3 G k + 2 + G k + 3 G k + 1 G k + 1 G k + 2 G k + 4 = 1 G 1 2 G 0 G 2 G k + 2 G k G k + 3 G k + 3 G k + 1 G k + 4 G k + 3 G k + 2 G k + 4 = 1 G 1 2 G 0 G 2 G k + 2 G k G k + 3 G k + 3 G k + 1 G k + 4 1 G k + 2 1 G k + 4 .
Applying the telescoping formula (T1) we complete the proof of (19). □
The final generalized sum is as follows.
Theorem 3.
We have
k = 1 1 G k G k + 1 G k + 2 G k + 3 G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = 1 2 G 1 G 2 2 G 3 3 G 4 .
Proof. 
We use (18) so that
1 G k G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = G k + 2 G k + 4 G k G k + 3 G k G k + 1 2 G k + 2 2 G k + 3 2 G k + 4 = 1 G k G k + 1 2 G k + 2 G k + 3 2 1 G k + 1 2 G k + 2 2 G k + 3 G k + 4 .
Letting
A ( k ) = 1 G k G k + 1 2 G k + 2 G k + 3 2 , B ( k ) = 1 G k 2 G k + 1 2 G k + 2 G k + 3
we have
1 G k G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = A ( k ) B ( k ) + B ( k ) B ( k + 1 ) .
Further notice that
G k + 3 2 G k 2 = ( G k + 3 G k ) ( G k + 3 + G k ) = 4 G k + 1 G k + 2 = 2 ( G k G k + 3 ) G k + 2 ,
therefore
A ( k ) B ( k ) = G k G k + 3 G k 2 G k + 1 2 G k + 2 G k + 3 2 = 1 2 · G k + 3 2 G k 2 ( G k G k + 3 ) 2 = 1 2 1 G k 2 G k + 1 2 G k + 2 2 1 G k + 1 2 G k + 2 2 G k + 3 2 .
Finally, we have
k = 1 1 G k G k + 1 G k + 2 G k + 3 G k + 4 1 G k + 1 + 1 G k + 2 1 G k + 3 = lim n 1 2 1 G 1 2 G 2 2 G 3 2 1 G n + 1 2 G n + 2 2 G n + 3 2 + B ( 1 ) B ( n + 1 ) = 1 G 1 2 G 2 2 G 3 G 4 1 2 G 1 2 G 2 2 G 3 2 = 2 G 3 G 4 G 4 2 2 ( G 1 G 4 ) 2 = G 1 G 4 2 ( G 1 G 4 ) 2 = 1 2 G 1 G 2 2 G 3 3 G 4
and we get (20). □
Continuing the current trend of generalizations, we shall recall the following identities obtained by Ohtsuka in 2018, proposed as Problem H-818 in The Fibonacci Quarterly, and solved in [24]:
S = k = 1 1 F k F k + 1 F k + 2 F k + 4 = 38 15 5 36 ,
T = k = 1 1 F k F k + 2 F k + 3 F k + 4 = 32 + 15 5 36 .
We now evaluate the Gibonacci case of these sums.
Theorem 4.
The following summation hold:
k = 1 1 G k G k + 1 G k + 2 G k + 3 = 1 2 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 .
Consequently, the following identities hold:
S G = k = 1 1 G k G k + 1 G k + 2 G k + 4 = 1 6 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 + 1 3 G 1 G 2 G 3 G 4 , T G = k = 1 1 G k G k + 2 G k + 3 G k + 4 = 1 6 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 + 2 3 G 1 G 2 G 3 G 4 .
Proof. 
Adding the two series gives
S G + T G = k = 1 G k + 1 + G k + 3 G k G k + 4 = k = 1 G k + 4 G k G k G k + 4 = k = 1 1 G k G k + 3 1 G k + 1 G k + 4 = 1 G 1 G 2 G 3 G 4 .
Subtracting, on the other hand, gives,
S G T G = k = 1 G k + 3 G k + 1 G k G k + 4 = k = 1 G k + 2 G k G k + 1 G k + 2 G k + 3 G k + 4 = 1 3 · k = 1 G k + 4 + G k G k G k + 4 = 1 3 · k = 1 1 G k + 1 G k + 4 + 1 G k G k + 3 .
We now apply identity (23) from [19] to obtain the following finite case of our sum:
2 ( G 1 2 G 0 2 G 0 G 1 ) · G 1 · k = 1 n 1 1 G k G k + 1 G k + 2 G k + 3 = G 3 + G 5 G 2 G 3 F n 1 G n + 3 F n G n + 1 + F n + 1 G n + 2 .
Using (16) we obtain
k = 1 1 G k G k + 1 G k + 2 G k + 3 = 1 2 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 .
This implies
S G T G = 1 3 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 1 3 G 1 G 2 G 3 G 4 .
Since S G + T G and S G T G are now explicitly given, solving for S G and T G gives the final result. □
We note that setting G n = F n in Theorem 4 restores (21) and (22). If we now let G n = L n , then we obtain a Lucas version of the identities:
S L = k = 1 1 L k L k + 1 L k + 2 L k + 4 = 115 42 5 2520 , T L = k = 1 1 L k L k + 2 L k + 3 L k + 4 = 85 + 42 5 2520 .
The next three corollaries are immediate consequences of Theorem 4.
Corollary 1.
We have
k = 1 G k 1 G k G k + 1 G k + 2 G k + 3 G k + 4 = 2 3 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 + 5 3 G 1 G 2 G 3 G 4 .
In particular,
k = 1 F k 1 F k F k + 1 F k + 2 F k + 3 F k + 4 = 30 5 67 18
and
k = 1 L k 1 L k L k + 1 L k + 2 L k + 3 L k + 4 = 84 5 185 1260 .
Proof. 
Calculate 3 T G S G and use
G k + 3 3 G k + 1 = G k 1 .
Corollary 2.
We have
k = 1 G k 1 G k + 1 G k + 2 G k + 3 G k + 4 G k + 5 = 7 6 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 8 3 G 1 G 2 G 3 G 4 G 1 G 1 G 2 G 3 G 4 G 5 .
In particular,
k = 1 F k 1 F k + 1 F k + 2 F k + 3 F k + 4 F k + 5 = 1174 525 5 180
and
k = 1 L k 1 L k + 1 L k + 2 L k + 3 L k + 4 L k + 5 = 7235 3234 5 27720 .
Proof. 
Calculate 2 S G 5 T G and use
2 G k + 3 5 G k + 1 = G k 2 .
Corollary 3.
We have
k = 1 G k + 1 + G k 1 G k G k + 1 G k + 2 G k + 3 G k + 4 = 5 6 ( G 1 2 G 0 2 G 0 G 1 ) G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 + 7 3 G 1 G 2 G 3 G 4 .
In particular,
k = 1 L k F k F k + 1 F k + 2 F k + 3 F k + 4 = 75 5 166 36
and
k = 1 F k L k L k + 1 L k + 2 L k + 3 L k + 4 = 6 5 13 360 .
Proof. 
Calculate 4 T G S G . □

3. Some Mixed Sums of Type (1)

In this section we are interested in the following kind of sums:
k = 1 1 G k G k + 4 G k + 5 3 G k + 1 1 G k + 2 4 G k + 3 = 1 G 2 G 3 G 4 G 5 , k = 1 1 G k G k + 4 G k + 5 1 G k + 1 + 2 G k + 2 + 3 G k + 3 = 1 G 1 G 3 G 4 G 5 ,
and similar ones (the two above will be justified later). Note that each term in the sum is the product of:
  • the product of the inverse of certain Gibonacci numbers,
  • the linear combination of the inverse of certain Gibonacci numbers,
  • and each Gibonacci number appears at most once in each term. In this section, we show several identities of that kind.
Theorem 5.
We have
k = 1 1 G k + 1 G k + 4 3 G k 2 G k + 2 3 G k + 3 = 2 G 1 G 3 G 4 .
Proof. 
The proof follows the flow of the proof of Theorem 1. First, we have
3 G k 2 G k + 2 3 G k + 3 = 3 G k + 2 G k + 3 2 G k G k + 3 3 G k G k + 2 G k G k + 2 G k + 3 = 2 G k + 1 G k + 4 2 G k G k + 2 G k G k + 2 G k + 3 ,
where we used the identity
3 G k + 2 G k + 3 2 G k G k + 3 3 G k G k + 2 = 2 G k + 1 G k + 4 2 G k G k + 2 .
This identity is justified by writing in the equivalent form
3 G k + 2 ( G k + 3 G k ) = 2 G k + 1 G k + 4 2 G k ( G k + 2 G k + 3 )
and then noting that each of the sides equals 6 G k + 1 G k + 2 . Note that we have used G k + G k + 4 = 3 G k + 2 and G k + 3 G k = 2 G k + 1 . □
Theorem 6.
We have
k = 1 1 G k + 1 G k + 4 3 G k 2 G k + 2 + 1 G k + 3 = 2 G 1 G 2 G 4 .
Proof. 
This time we use
3 G k 2 G k + 2 + 1 G k + 3 = 3 G k + 2 G k + 3 2 G k G k + 3 + G k G k + 2 G k G k + 2 G k + 3
and apply the identity
3 G k + 2 G k + 3 2 G k G k + 3 + G k G k + 2 = G k + 3 G k + 4 G k G k + 1 ,
which can be verified by simple manipulation based on the recurrence relation. This implies
k = 1 1 G k + 1 G k + 4 3 G k 2 G k + 2 + 1 G k + 3 = k = 1 1 G k G k + 1 G k + 2 1 G k + 2 G k + 3 G k + 4 = 1 G 1 G 2 G 3 + 1 G 2 G 3 G 4 = G 1 + G 4 G 1 G 4 = 2 G 3 G 1 G 4 = 2 G 1 G 2 G 4 .
We have discovered many more identities of the form described at the beginning of this section. The following set shares the same indices in the corresponding places of the left-hand side of the identity, but the coefficients differ.
Corollary 4.
We have the following identities:
k = 1 1 G k G k + 4 G k + 5 6 G k + 1 + 3 G k + 2 3 G k + 3 = 1 G 1 G 2 G 3 G 4 + 1 G 2 G 3 G 4 G 5 , k = 1 1 G k G k + 4 G k + 5 3 G k + 1 1 G k + 2 4 G k + 3 = 1 G 2 G 3 G 4 G 5 , k = 1 1 G k G k + 4 G k + 5 1 G k + 1 + 2 G k + 2 + 3 G k + 3 = 1 G 1 G 3 G 4 G 5 , k = 1 1 G k G k + 4 G k + 5 2 G k + 1 + 1 G k + 2 1 G k + 3 = 1 G 1 G 2 G 4 G 5 , k = 1 1 G k G k + 4 G k + 5 1 G k + 1 + 3 G k + 2 + 2 G k + 3 = 1 G 1 G 2 G 3 G 5 , k = 1 1 G k G k + 4 G k + 5 3 G k + 1 + 4 G k + 2 + 1 G k + 3 = 1 G 1 G 2 G 3 G 4 .
Proof. 
All identities can be verified with simple Gibonacci identities and with the recurrence relation (similarly to other identities from this section). In particular, it can be verified that
6 G k + 1 + 3 G k + 2 3 G k + 3 = G k + 4 G k + 5 G k G k + 1 G k + 1 G k + 2 G k + 3 , 3 G k + 1 1 G k + 2 4 G k + 3 = G k + 1 G k + 5 G k G k + 1 G k + 1 G k + 2 G k + 3 , 1 G k + 1 + 2 G k + 2 + 3 G k + 3 = G k + 1 G k + 5 G k G k + 2 G k + 1 G k + 2 G k + 3 , 2 G k + 1 + 1 G k + 2 1 G k + 3 = G k + 2 G k + 5 G k G k + 3 G k + 1 G k + 2 G k + 3 , 1 G k + 1 + 3 G k + 2 + 2 G k + 3 = G k + 3 G k + 5 G k G k + 4 G k + 1 G k + 2 G k + 3 , 3 G k + 1 + 4 G k + 2 + 1 G k + 3 = G k + 4 G k + 5 G k G k + 5 G k + 1 G k + 2 G k + 3 .
Then, for example,
1 G k G k + 4 G k + 5 · G k + 4 G k + 5 G k G k + 1 G k + 1 G k + 2 G k + 3 = 1 G k G k + 3 1 G k + 2 G k + 5
from which the first identity follows. □
Remark 1.
We note that in Corollary 4 the second and the sixth generate all of the cases. This is because
span { ( 6 , 3 , 3 ) , ( 3 , 1 , 4 ) , ( 1 , 2 , 3 ) , ( 2 , 1 , 1 ) , ( 1 , 3 , 2 ) , ( 3 , 4 , 1 ) } = span { ( 3 , 1 , 4 ) , ( 3 , 4 , 1 ) } .
Despite our best efforts, we were unable to find the exceptional identity with (rational) coefficients A , B and C, that is, the identity which left-hand side is
k = 1 1 G k G k + 4 G k + 5 A G k + 1 + B G k + 2 + C G k + 3 ,
such that
span { ( 3 , 1 , 4 ) , ( 3 , 4 , 1 ) , ( A , B , C ) } = R 3 .
This would imply the closed form for all identities with arbitrary coefficients A , B and C.

4. Miscellaneous Identities

Theorem 7.
We have
k = 1 1 G k G k + 2 G k + 3 = 1 2 G 1 G 2 G 3 .
Proof. 
Use
1 G k G k + 2 G k + 3 = 1 2 G k + 3 G k G k G k + 1 G k + 2 G k + 3
from which (T1) can be applied. □
Theorem 8.
For all m 0 we have
k = 1 1 G k G k + 2 m G k + 2 m + 2 G k + 4 m + 2 = 1 L 2 m + 1 G 1 G 4 m + 2 .
In particular,
k = 1 1 G k G k + 2 = 1 G 1 G 2
and
k = 1 1 G k G k + 1 G k + 2 G k + 4 G k + 5 G k + 6 = 1 4 G 1 G 6 .
Proof. 
We use (11). Take an odd m and make the replacement m 2 m + 1 in (11) to get
L 2 m + 1 G k + 2 m + 1 = G k + 4 m + 2 G k .
Applying (T1) gives for a fixed n > 1 :
k = 1 n L 2 m + 1 G k + 2 m + 1 G k G k + 2 m G k + 2 m + 1 G k + 2 m + 2 G k + 4 m + 2 = k = 1 n G k + 4 m + 2 G k G k G k + 4 m + 2 = k = 1 n 1 G k G k + 4 m + 1 1 G k + 1 G k + 4 m + 2 = 1 G 1 G 4 m + 2 1 G n + 1 G n + 4 m + 2 .
The next theorem showcases a simple example of an infinite family of identities with similar structure.
Theorem 9.
We have
k = 1 1 G k + 2 G k + m F m G k + F m 1 1 G k + 1 = 1 G 1 G m .
Proof. 
Use
F m G k + F m 1 1 G k + 1 = G k + 1 F m G k + F m 1 G k G k G k + 1 = G k + m G k G k G k + 1
and apply (T1). □
The the next relation is an alternating version of (25) in case m = 4 .
Theorem 10.
We have
k = 1 ( 1 ) k G k + 2 G k + 3 G k + 4 3 G k + 1 G k + 1 = 1 G 1 2 G 0 G 2 1 G 1 G 2 + 1 G 1 G 4 1 G 3 G 4 1 2 G 2 G 3 1 2 ( G 1 2 G 0 G 2 ) k = 1 1 G k G k + 1 .
Proof. 
Start with
3 G k + 1 G k + 1 = 3 G k + 1 + G k G k G k + 1 = G k + 4 G k G k G k + 1
and
( 1 ) k G k + 2 G k + 3 G k + 4 3 G k + 1 G k + 1 = ( 1 ) k G k G k + 3 + ( 1 ) k + 1 G k + 1 G k + 4 .
We now apply the Cassini identity to have:
( 1 ) k G k G k + 3 + ( 1 ) k + 1 G k + 1 G k + 4 = 1 G 1 2 G 0 G 2 G k + 1 G k + 3 G k + 2 2 G k G k + 3 + G k + 2 G k + 4 G k + 3 2 G k + 1 G k + 4 = 1 G 1 2 G 0 G 2 1 G k G k + 2 + G k + 1 G k + 3 G k G k + 1 G k + 3 + 1 G k + 1 G k + 3 G k + 1 + G k + 2 G k + 1 G k + 2 G k + 4 = 1 G 1 2 G 0 G 2 1 G k G k + 2 + 1 G k G k + 3 1 G k G k + 1 + 1 G k G k + 3 1 G k + 2 G k + 4 1 G k + 1 G k + 4 .
From that we get, using (T1),
k = 1 ( 1 ) k G k + 2 G k + 3 G k + 4 3 G k + 1 G k + 1 = 1 G 1 2 G 0 G 2 1 G 1 G 2 + 1 G 1 G 4 1 G 3 G 4 1 2 G 2 G 3 1 2 ( G 1 2 G 0 G 2 ) k = 1 1 G k G k + 1 ,
as
k = 1 1 G k G k + 2 = 1 G 1 G 2
and
k = 1 1 G k G k + 3 = 1 2 k = 1 1 G k G k + 1 1 2 1 G 2 G 3 .
One of the original Brousseau sums is [7, Identity (9)]:
k = 1 F k + 3 F k F k + 2 F k + 4 F k + 6 = 17 480 .
This sum is a special case of the following sum with the structure similar to the previous sums from this section.
Theorem 11.
Let p , q , m be odd positive integers. Then
k = 1 G k m + p q m G k m G k m + 2 q m G k m + 2 p q m = 1 L p q m j = 1 2 q 1 G j m G j m + 2 q m G j m + 2 ( p 1 ) q m .
Proof. 
Write (with the use of (11))
L p q m G k m + p q m G k m G k m + 2 q m G k m + 2 p q m = G k m + 2 p q m G k m G k m G k m + 2 q m G k m + 2 p q m ,
simplify and apply (T1). Note that the first term in the telescoping sum is
1 G m G m + 2 q m G m + 2 ( p 1 ) q m 1 G m + 2 q m G m + 3 q m G m + 2 p q m ,
which justifies the sum obtained in the final form. □
If we now set m = q = 1 and p = 3 in Theorem 11, we restore (26).
Theorem 12.
Let m > 0 be odd. Then we have
k = 1 n ( 1 ) k 1 G m k G m ( k + 3 ) G m ( k + 1 ) G m ( k + 2 ) + G m ( k + 2 ) G m ( k + 1 ) = ( 1 ) n + 1 G m ( n + 1 ) G m ( n + 3 ) + 1 G m G 3 m
and in the limiting case we also have
k = 1 ( 1 ) k 1 G m k G m ( k + 3 ) G m ( k + 1 ) G m ( k + 2 ) + G m ( k + 2 ) G m ( k + 1 ) = 1 G m G 3 m .
Proof. 
The identity follows from
1 G m k G m ( k + 3 ) G m ( k + 1 ) G m ( k + 2 ) + G m ( k + 2 ) G m ( k + 1 ) = G m ( k + 1 ) 2 + G m ( k + 2 ) 2 G m k G m ( k + 1 ) G m ( k + 2 ) G m ( k + 3 )
and further noting that, with the aid of Identity (13),
G m ( k + 1 ) 2 + G m ( k + 2 ) 2 = ( 1 ) m + 1 G m ( k + 1 ) 2 + G m ( k + 2 ) ( L m G m ( k + 1 ) + G m k ) = G m ( k + 1 ) ( L m G m ( k + 2 ) + ( 1 ) m + 1 G m ( k + 1 ) ) + G m k G m ( k + 2 ) = G m ( k + 1 ) G m ( k + 3 ) + G m k G m ( k + 2 ) .
We can now apply (T2) with f k = 1 G m k G m ( k + 2 ) . □

5. Series with Higher Powers

This part of our article is inspired by another problem proposal by Ohtsuka from 2024. In Problem H-938 [26] the readers are asked to prove the following relation:
k = 1 1 F k 2 F k + 1 2 = k = 1 1 F k 2 F k + 2 2 + 13 5 5 2 .
First, we derive a Gibonacci generalization of this statement. Second, we study similar series those closed forms involve squares of certain Gibonacci numbers.
Theorem 13.
We have
k = 1 1 G k 2 G k + 1 2 = k = 1 1 G k 2 G k + 2 2 + G 3 2 G 2 2 G 2 G 1 G 2 2 G 3 2 + 1 G 1 2 G 0 2 G 0 G 1 G 3 + G 5 G 1 G 2 G 3 5 G 1 2 α + G 0 G 1 .
Proof. 
Let Q G denote the difference of the sums in question, i.e.,
Q G = k = 1 1 G k 2 G k + 1 2 1 G k 2 G k + 2 2 .
We have
Q G = k = 1 G k + 2 2 G k + 1 2 G k 2 G k + 1 2 G k + 2 2 = k = 1 G k G k + 1 + G k G k + 2 G k 2 G k + 1 2 G k + 2 2 = k = 1 1 G k G k + 1 G k + 2 2 + 1 G k G k + 1 2 G k + 2 .
Now, as
1 G k G k + 1 G k + 2 2 = G k + 3 G k G k + 1 G k + 2 2 G k + 3 = 1 G k G k + 2 2 G k + 3 + 1 G k G k + 1 G k + 2 G k + 3
and
1 G k G k + 1 2 G k + 2 = G k + 1 G k G k 1 G k G k + 1 2 G k + 2 = 1 G k 1 G k G k + 1 G k + 2 1 G k 1 G k + 1 2 G k + 2 ,
we can write
Q G = 1 G 1 2 G 2 2 1 G 1 2 G 3 2 + k = 2 1 G k G k + 2 2 G k + 3 1 G k 1 G k + 1 2 G k + 2 + k = 2 1 G k G k + 1 G k + 2 G k + 3 + 1 G k 1 G k G k + 1 G k + 2 .
We apply the telescoping principle (T1) and end up with
Q G = = G 3 2 G 2 2 G 1 G 2 2 G 3 2 1 G 1 G 3 2 G 4 1 G 1 G 2 G 3 G 4 + 2 k = 1 1 G k G k + 1 G k + 2 G k + 3 .
The statement follows from (23) and some basic simplifications. □
When G n = F n then we get (27) from (28). When G n = L n then (28) yields
k = 1 1 L k 2 L k + 1 2 = k = 1 1 L k 2 L k + 2 2 + 25 9 5 90 .
Theorem 14.
We have for all m , q > 0 :
k = 1 1 G k m G k m + q m G k m + 2 q m 1 G k m + ( 1 ) m + 1 G k m + 2 q m = 1 L q m j = 1 q 1 G j m 2 G j m + q m 2 .
In particular,
k = 1 1 G k G k + 1 G k + 2 1 G k + 1 G k + 2 = 1 G 1 2 G 2 2
and
k = 1 1 G 2 k G 2 ( k + 1 ) G 2 ( k + 2 ) 1 G 2 k 1 G 2 ( k + 2 ) = 1 3 G 2 2 G 4 2 .
Proof. 
Notice that by (11):
1 G k m G k m + q m G k m + 2 q m 1 G k m + ( 1 ) m + 1 G k m + 2 q m = ( G k m + 2 q m + ( 1 ) m + 1 G k m ) G k m + q m G k m 2 G k m + q m 2 G k m + 2 q m 2 = ( G k m + 2 q m + ( 1 ) m + 1 G k m ) ( G k m + 2 q m + ( 1 ) m G k m ) L q m G k m 2 G k m + q m 2 G k m + 2 q m 2 = G k m + 2 q m 2 G k m 2 L q m G k m 2 G k m + q m 2 G k m + 2 q m 2 = 1 L q m 1 G k m 2 G k m + q m 2 1 G k m + q m 2 G k m + 2 q m 2 .
Use (T1). □
Theorem 15.
We have
k = 1 1 G k 2 G k + 1 G k + 3 G k + 4 2 1 G k + 1 + 1 G k + 3 = 1 3 ( G 1 G 4 ) 2 .
Proof. 
Use G k + 4 + G k = 3 G k + 2 and G k + 4 G k = G k + 1 + G k + 3 to obtain
1 G k 2 G k + 1 G k + 3 G k + 4 2 1 G k + 1 + 1 G k + 3 = G k + 1 G k + 2 + G k + 2 G k + 3 ( G k G k + 4 ) 2 = G k + 4 2 G k 2 3 ( G k G k + 4 ) 2 .
A more general result, similar to (31) can also be obtained.
Theorem 16.
For odd m > 0 we have
k = 1 1 G k 2 G k + m 2 2 G k + m 1 G k + m G k + m + 1 G k + m + 2 2 G k + 2 m 2 1 G k + m 1 + 1 G k + m + 1 = 1 F 2 m ( G 1 G 2 m ) 2 ,
where the case m = 1 is understood as
k = 1 + 1 G k G k + 1 G k + 2 1 G k + 1 G k + 2 = 1 G 1 1 G 2 2 .
Proof. 
Rewrite
1 G k 2 G k + m 2 2 G k + m 1 G k + m G k + m + 1 G k + m + 2 2 G k + 2 m 2 1 G k + m 1 + 1 G k + m + 1 = G k + m ( G k + m 1 + G k + m + 1 ) ( G k G k + 2 m ) 2 = 1 F m 1 L m ( G k + 2 m G k ) ( G k + 2 m + G k ) ( G k G k + 2 m ) 2 = G k + 2 m 2 G k 2 F 2 m ( G k G k + 2 m ) 2 .
Note that we have used G k + 2 m G k = L m G k + m (cf. Identity (11)) as well as G k + 2 m + G k = F m ( G k + m 1 + G k + m + 1 ) for odd m (cf. Identity (12)). □
When G n = F n or G n = L n , then we get from (33) the sums
k = 1 + 1 F k F k + 1 F k + 2 1 F k + 1 F k + 2 = 1 , k = 1 + 1 L k L k + 1 L k + 2 1 L k + 1 L k + 2 = 1 4
and we get from (32) the sum
k = 1 + 1 F k 2 F k + 1 2 F k + 2 F k + 3 F k + 4 F k + 5 2 F k + 6 2 1 F k + 2 + 1 F k + 4 = 1 460 800 .
Theorem 17.
We have
k = 1 1 G k G k + 3 G k + 3 G k + 2 + G k G k + 1 = 1 G 1 G 2 2 G 3 .
Proof. 
We calculate
1 G k G k + 3 G k + 3 G k + 2 + G k G k + 1 = G k + 1 G k + 3 + G k G k + 2 G k G k + 1 2 G k + 2 2 G k + 3 = 1 G k G k + 1 G k + 2 2 + 1 G k + 1 2 G k + 2 G k + 3 .
Set
A ( k ) = 1 G k G k + 1 G k + 2 2 , B ( k ) = 1 G k 2 G k + 1 G k + 2 .
Then,
1 G k G k + 3 G k + 3 G k + 2 + G k G k + 1 = A ( k ) + B ( k + 1 ) = A ( k ) + B ( k ) + B ( k + 1 ) B ( k ) .
Thus, using (30) (where the series involving A ( k ) + B ( k ) is computed) we obtain
k = 1 1 G k G k + 3 G k + 3 G k + 2 + G k G k + 1 = k = 1 1 G k G k + 1 G k + 2 1 G k + 1 G k + 2 + k = 1 B ( k + 1 ) B ( k ) = 1 G 1 2 G 2 2 B ( 1 ) = 1 G 1 2 G 2 2 1 G 1 2 G 2 G 3 = 1 G 1 G 2 2 G 3 .
The proof is completed. □
This is a generalization of the previous result.
Theorem 18.
We have for all odd m > 0
k = 1 1 G k m G k m + q m G k m + 2 q m G k m + 3 q m G k m + 3 q m G k m + 2 q m + ( 1 ) m + 1 G k m G k m + q m = 1 L q m k = 1 q 1 G j m G j m + q m 2 G j m + 2 q m
and for all even m > 0
k = 1 1 G k m G k m + q m G k m + 2 q m G k m + 3 q m G k m + 3 q m G k m + 2 q m + ( 1 ) m + 1 G k m G k m + q m = 1 L q m j = 1 q G j m + 2 q m + L q m G j m + q m G j m 2 G j m + q m 2 G j m + 2 q m .
Proof. 
Calculate
1 G k m G k m + q m G k m + 2 q m G k m + 3 q m G k m + 3 q m G k m + 2 q m + ( 1 ) m + 1 G k m G k m + q m = G k m + q m G k m + 3 q m + ( 1 ) m + 1 G k m + 2 q m G k m G k m G k m + q m 2 G k m + 2 q m 2 G k m + 3 q m = 1 G k m G k m + q m G k m + 2 q m 2 + ( 1 ) m + 1 G k m + q m 2 G k m + 2 q m G k m + 3 q m .
Let
A ( k ) = 1 G k m G k m + q m G k m + 2 q m 2 , B ( k ) = ( 1 ) m + 1 G k m 2 G k m + q m G k m + 2 q m .
Then each term of the desired sum equals
A ( k ) + B ( k + q ) = ( A ( k ) + B ( k ) ) + ( B ( k + q ) B ( k ) ) .
We now use (29) to compute k = 1 ( A ( k ) + B ( k ) ) and we notice that
k = 1 ( B ( k + q ) B ( k ) ) = j = 1 q B ( j ) ,
thus the desired sum equal, with the aid of (11),
1 L q m k = 1 q 1 G j m 2 G j m + q m 2 j = 1 q ( 1 ) m + 1 G j m 2 G j m + q m G j m + 2 q m = 1 L q m j = 1 q G j m + 2 q m + ( 1 ) m L q m G j m + q m G j m 2 G j m + q m 2 G j m + 2 q m .
If m is odd, then the numerator simplifies to G j m via (11), which concludes (34). Otherwise, for even m we have (35). □

6. A New Look at Brousseau Sums

Particular cases of the sums discussed in this section appeared in [4, Corollary 1], but the final form is different than ours.
Theorem 19.
If m and q are positive integers, then
k = 1 ( 1 ) m k G m k G m k + m q = 1 ε G F m q q α k = 1 q G m k + 1 G m k .
Proof. 
It is known that [2]
k = 1 n ( 1 ) m k G m k G m k + m q = F m n F m q k = 1 q ( 1 ) m k G m k G m k + m n , m , q Z + .
Therefore,
k = 1 ( 1 ) m k G m k G m k + m q = 1 F m q k = 1 q ( 1 ) m k G m k lim n F m n G m k + m n ,
from which (36) follows on account of (16). □
Theorem 20.
If m and q are positive integers, then
k = 1 1 G m k G m k + 2 m q = 1 ε G F 2 m q k = 1 2 q ( 1 ) m k 1 G m k + 1 G m k
and
k = 1 ( 1 ) k ( m 1 ) G m k G m k + 2 m q = 1 ε G F 2 m q k = 1 2 q ( 1 ) k 1 G m k + 1 G m k .
Proof. 
Similar to the proof of Theorem 19. We use [2]:
k = 1 2 n ( ± 1 ) k ( m 1 ) G m k G m k + 2 m q = F 2 m n F 2 m q k = 1 2 q ( ± 1 ) k ( m 1 ) G m k G m k + 2 m n .
Theorem 21.
If m and n are non-negative integers, then
k = 1 2 n 1 G k G k + 2 m = F 2 n F 2 m k = 1 2 m 1 G k G k + 2 n
and
k = 1 2 n 1 G k G k + 2 m + 1 = 1 F 2 m + 1 k = 1 2 n 1 G k G k + 1 F 2 n F 2 m + 1 k = 1 2 m 1 G k G k + 2 n F 2 m F 2 m + 1 G 2 n + 1 G 2 n + 2 m + 1 + F 2 m F 2 m + 1 G 1 G 2 m + 1 .
Proof. 
Set m = 1 in (38) and write m for q to obtain (39).
Write 2 m + 1 for r in (10):
1 G k F 2 m G k + 2 m + 1 = F 2 m + 1 G k + 1 G k G k + 2 m + 1 ,
and arrange as
F 2 m + 1 G k G k + 2 m + 1 = 1 G k G k + 1 F 2 m G k + 1 G k + 2 m + 1 .
Now sum, to obtain, after a shift of summation index,
k = 1 n 1 G k G k + 2 m + 1 = 1 F 2 m + 1 k = 1 n 1 G k G k + 1 F 2 m F 2 m + 1 k = 1 n 1 G k G k + 2 m F 2 m F 2 m + 1 G n + 1 G n + 2 m + 1 + F 2 m F 2 m + 1 G 1 G 2 m + 1 .
Write 2 n for n and use (39) to re-write the second term on the right hand side; this gives (40). □
As a corollary, we obtain the infinite series version of the above theorem.
Corollary 5.
If m is a non-negative integer, then
k = 1 1 G k G k + 2 m = 1 ε G F 2 m k = 1 2 m ( 1 ) k 1 G k + 1 G k
and
k = 1 1 G k G k + 2 m + 1 = 1 F 2 m + 1 k = 1 1 G k G k + 1 1 ε G F 2 m + 1 k = 1 2 m ( 1 ) k 1 G k + 1 G k + F 2 m F 2 m + 1 G 1 G 2 m + 1 .
In particular,
k = 1 1 G k G k + 2 = 1 G 1 G 2
and
k = 1 1 G k G k + 3 = 1 2 k = 1 1 G k G k + 1 1 2 1 G 2 G 3 .
Theorem 22.
If p is a positive integer and m and r are non-negative integers such that m is greater than r, then,
k = 1 n ( 1 ) p k G p k + p r G p k + p m = ( 1 ) p r F p n F p m p r k = r + 1 m ( 1 ) p k G p k G p k + p n .
In particular,
k = 1 n ( 1 ) k G k + r G k + m = ( 1 ) r F n F m r k = r + 1 m ( 1 ) k G k G k + n .
Proof. 
Making the replacements k p k , m p m and r p r in (14), we have
F p m p r G p k + p r G p k + p m = ( 1 ) p r F p m G p k G p k + p m ( 1 ) p r F p r G p k G p k + p r .
Now multiply each term by ( 1 ) p k and sum from k = 1 to k = n , making use of (37). □
Corollary 6.
If p is a positive integer and m and r are non-negative integers such that m is greater than r, then,
k = 1 ( 1 ) p k G p k + p r G p k + p m = ( 1 ) p r ε G F p m p r ( m r ) α k = r + 1 m G p k + 1 G p k .
In particular,
k = 1 ( 1 ) k G k + r G k + m = ( 1 ) r ε G F m r ( m r ) α k = r + 1 m G k + 1 G k .
Remark 2.
It should be noted that our results cannot be compared tothe sums obtained by Farhi in [9]. Our results concern arbitrary Gibonacci sequences, whereas his results are related to Lucas sequences of the first and second kinds.

7. Sums with Products of Gibonacci Numbers in the Denominator

The identity (T3) can be generalized to the following, which can be easily proven, for example, by direct computation.
Lemma 2.
If g ( k ) = ( g k ) k Z + is a sequence of complex numbers, n and r are integers and c and d are any numbers, then
k = 1 n d n k c k 1 g k + 1 g k + 2 g k + r 1 ( c g k + r d g k ) = c n g n + 1 g n + 2 g n + r d n g 1 g 2 g r .
The Lemma turns out to be extremely useful in finding a variety of identities of our interest. The remainder of this section showcases many of its applications
Theorem 23.
If r is a positive integer, then
k = 1 n ( 1 ) k ( r + 1 ) G k G k + 1 G k + r 1 G k + r + 1 G k + 2 r = ( 1 ) r n + n + r L r G n + 1 G n + 2 G n + 2 r ( 1 ) r L r G 1 G 2 G 2 r .
In particular,
k = 1 n ( 1 ) k G k G k + 1 G k + 3 G k + 4 = ( 1 ) n 3 G n + 1 G n + 2 G n + 3 G n + 4 1 3 G 1 G 2 G 3 G 4
and
k = 1 n 1 G k G k + 1 G k + 2 G k + 4 G k + 5 G k + 6 = 1 4 G 1 G 2 G 3 G 4 G 5 G 6 1 4 G n + 1 G n + 2 G n + 3 G n + 4 G k + 5 G k + 6 .
Proof. 
With (9) in mind, identity (42) follows upon use of g ( k ) = 1 / G k , c = ( 1 ) r and d = 1 in (41). □
Corollary 7.
If r is a positive integer, then
k = 1 ( 1 ) k ( r + 1 ) G k G k + 1 G k + r 1 G k + r + 1 G k + 2 r = ( 1 ) r 1 L r G 1 G 2 G 2 r .
Theorem 24.
If m and r are positive integers such that r > m , then
k = 1 n ( 1 ) k ( m + 1 ) F r m / F m k G k G k + 1 G k + m 1 G k + m + 1 G k + r 1 G k + r = ( 1 ) n m + n + m F r m / F m n F r m F r G n + 1 G n + 2 G n + r ( 1 ) m F r m F r G 1 G 2 G r .
In particular, at m = 2 , r = 3 , we find
k = 1 n ( 1 ) k 1 G k G k + 1 G k + 3 = ( 1 ) n 1 2 G n + 1 G n + 2 G n + 3 + 1 2 G 1 G 2 G 3
and at m = 2 , r = 4 we get
k = 1 n ( 1 ) k 1 G k G k + 1 G k + 3 G k + 4 = ( 1 ) n 1 3 G n + 1 G n + 2 G n + 3 G n + 4 + 1 3 G 1 G 2 G 3 G 4 .
Proof. 
Choosing c = F m r and d = ( 1 ) r F m in (41) together with (14) gives (43). □
Remark 3.
Identity (24) is reproduced as the limiting case of choosing m = 1 , r = 3 in (43).
Corollary 8.
If m and r are positive integers such that r > m , then
k = 1 ( 1 ) k ( m + 1 ) F r m / F m k G k G k + 1 G k + m 1 G k + m + 1 G k + r 1 G k + r = ( 1 ) m + 1 F r m F r G 1 G 2 G r .
Setting r = m + 1 in (43) leads to the next result.
Corollary 9.
If m is a positive integer, then
k = 1 n ( 1 ) k ( m + 1 ) F m k G k G k + 1 G k + m 1 G k + m + 1 = ( 1 ) n m + n + m F m n F m + 1 G n + 1 G n + 2 G n + m + 1 ( 1 ) m F m + 1 G 1 G 2 G m + 1 ,
with the limiting value
k = 1 ( 1 ) k ( m + 1 ) F m k G k G k + 1 G k + m 1 G k + m + 1 = ( 1 ) m + 1 F m + 1 G 1 G 2 G m + 1 .
Theorem 25.
If r > 1 is a positive integer, then
k = 1 n F r 1 k 1 G k G k + 2 G k + r = 1 F r G 1 G 2 G r F r 1 n F r G n + 1 G n + 2 G n + r ,
with the limiting value
k = 1 F r 1 k 1 G k G k + 2 G k + r = 1 F r G 1 G 2 G r .
Proof. 
Use c = F r 1 and d = 1 in (41) in conjunction with (10). □
Theorem 26.
If n is a non-negative integer, r > 1 is a positive integer and G 0 0 , then
k = 1 n ( 1 ) k 1 F k + 1 F k + r 1 G k G k + 1 G k + r = 1 G 0 F r F 1 F 2 F r G 1 G 2 G r F n + 1 F n + 2 F n + r G n + 1 G n + 2 G n + r .
In particular,
k = 1 n ( 1 ) k 1 F k + r F k + r + 1 = 1 F r 1 F r + 1 F n + 1 F n + r + 1
and
k = 1 n ( 1 ) k 1 F k + 1 G k G k + 1 G k + 2 = 1 G 0 1 G 1 G 2 F n + 1 F n + 2 G n + 1 G n + 2 .
Proof. 
Set c = 1 = d and g ( k ) = F k / G k in (41) and use the following identity [29, Identity (21)]:
F k + r G k + r F k G k = ( 1 ) k G 0 F r G k G k + r .
Corollary 10.
If r > 1 is a positive integer and G 0 0 , then
k = 1 ( 1 ) k 1 F k + 1 F k + r 1 G k G k + 1 G k + r = 1 G 0 F r F 1 F 2 F r G 1 G 2 G r 1 ( G 1 G 0 β ) r .
In particular,
k = 1 ( 1 ) k 1 F k + r F k + r + 1 = 1 F r 1 F r + 1 1 α r
and
k = 1 ( 1 ) k 1 F k + 1 G k G k + 1 G k + 2 = 1 G 0 1 G 1 G 2 1 ( G 1 G 0 β ) 2 .
Remark 4.
We note that (44) and (45) are not new. These results are special cases of another generalization, namely,
k = 1 n ( 1 ) m ( k + 1 ) F k m + r F k m + m + r = F m n F m F m + r F m n + m + r , m 1 , r 0 ,
which can be found in [13] or [19]. When m = 1 then
k = 1 n ( 1 ) k + 1 F k + r F k + 1 + r = F n F r + 1 F n + 1 + r .
The equivalence of (44) and the last identity is readily seen by noting that
F n + 1 + r F r + 1 F n + 1 = F r F n .
Theorem 27.
If n is a non-negative integer and r > 1 is a positive integer, then
k = 1 n ( 1 ) k 1 G k + 1 G k + 2 G k + r 1 G k + r G k + r + 1 G k + 2 r = 1 ε G F r 2 G n + 1 G n + 2 G n + r G n + r + 1 G n + r + 2 G n + 2 r G 1 G 2 G r G r + 1 G r + 2 G 2 r .
In particular,
k = 1 n ( 1 ) k 1 G k + 1 G k + 2 G k + 3 G k + 4 = 1 ε G G n + 1 G n + 2 G n + 3 G n + 4 G 1 G 2 G 3 G 4 .
Proof. 
Use g ( k ) = G k / G k + r and c = 1 = d in (41), noting that (variation on Tagiuri’s identity)
G k + r G k + 2 r G k G k + r = ( 1 ) k 1 F r 2 ε G G k + r G k + 2 r .
Corollary 11.
If r > 1 is a positive integer, then
k = 1 ( 1 ) k 1 G k + 1 G k + 2 G k + r 1 G k + r G k + r + 1 G k + 2 r = 1 ε G F r 2 ( 1 ) r β F r 2 + F r 2 1 G 1 G 2 G r G r + 1 G r + 2 G 2 r .
In particular,
k = 1 ( 1 ) k 1 G k + 1 G k + 2 G k + 3 G k + 4 = 1 ε G 3 β + 2 G 1 G 2 G 3 G 4 .
Theorem 28.
If n is a non-negative integer and r 2 is an even integer, then
k = 1 n G 2 k + r F k G k F k + 1 G k + 1 F k + r G k + r = 1 F r 1 F 1 G 1 F r G r 1 F n + 1 G n + 1 F n + r G n + r .
In particular,
k = 1 n G 2 k + 2 F k G k F k + 1 G k + 1 F k + 2 G k + 2 = 1 G 1 G 2 1 F n + 1 G n + 1 F n + 2 G n + 2 .
Proof. 
Use g ( k ) = 1 / ( F k G k ) and c = 1 = d in (41), noting that
1 F n G n 1 F n + r G n + r = F r G 2 n + r F n G n F n + r G n + r ,
which itself is a consequence of
F r G 2 n + r = F n + r G n + r F n G n , r even .
Corollary 12.
If r 2 is an even integer, then
k = 1 G 2 k + r F k G k F k + 1 G k + 1 F k + r G k + r = 1 F r 1 F 1 G 1 F r G r .
In particular,
k = 1 G 2 k + 2 F k G k F k + 1 G k + 1 F k + 2 G k + 2 = 1 G 1 G 2 .

8. Conclusions

It should be clear that the possibilities do not end here and we (or the reader) could derive many more identities based on the telescoping principle. We focused mainly on (T1), (T3) and (41) and these simple rules enabled us to discover a multitude of identities with Gibonacci numbers in the denominator and, in some cases, in the numerator, including the alternating versions of some identities.
In the Introduction we announced that we would not give that much attention to (T2). However, using the ideas introduced in various sections of this article, it possible to utilize that telescoping identity. For example, we can present the following variation of Corollary 4.
Corollary 13.
We have the following identities:
k = 1 ( 1 ) k + 1 G k G k + 4 G k + 5 3 G k + 1 3 G k + 2 = 1 G 2 G 3 G 4 G 5 , k = 1 ( 1 ) k + 1 G k G k + 4 G k + 5 1 G k + 1 + 2 G k + 2 1 G k + 3 = 1 G 1 G 3 G 4 G 5 , k = 1 ( 1 ) k + 1 G k G k + 4 G k + 5 4 G k + 1 1 G k + 2 1 G k + 3 = 1 G 1 G 2 G 4 G 5 , k = 1 ( 1 ) k + 1 G k G k + 4 G k + 5 5 G k + 1 + 1 G k + 2 2 G k + 3 = 1 G 1 G 2 G 3 G 5 , k = 1 ( 1 ) k + 1 G k G k + 4 G k + 5 9 G k + 1 3 G k + 3 = 1 G 1 G 2 G 3 G 4 .
Proof. 
Use the following set of identities in order:
3 G k + 2 G k + 3 3 G k + 1 G k + 3 = G k + 5 G k + G k + 1 G k , G k + 2 G k + 3 + 2 G k + 1 G k + 3 G k + 1 G k + 2 = G k + 5 G k + 1 + G k + 2 G k , 4 G k + 2 G k + 3 G k + 1 G k + 3 G k + 1 G k + 2 = G k + 5 G k + 2 + G k + 3 G k , 5 G k + 2 G k + 3 + G k + 1 G k + 3 2 G k + 1 G k + 2 = G k + 5 G k + 3 + G k + 4 G k , 9 G k + 2 G k + 3 3 G k + 1 G k + 2 = G k + 5 G k + 4 + G k + 5 G k .
Follow the proof of Corollary 4 and apply (T2). □
We observe that the identities appearing in the proof of Corollary 13 exhibit an elegant structure. In each respective case, the right-hand side is G k + 5 G k + i + G k + i + 1 G k for i = 1 , , 4 . Therefore, it is interesting to find similar patterns that could be used for Gibonacci identities, including patterns involving products of more than two terms.
We encourage readers to explore the potential applications of (T2) and other telescoping principles to summation problems.

References

  1. K. Adegoke, Generalizations of reciprocal Fibonacci-Lucas sums of Brousseau, J. Integer Seq. 21 (2018), Article 18.1.6.
  2. K. Adegoke, O. Oshin and A. Olatinwo, Symmetry properties of finite sums involving generalized Fibonacci numbers, Moroccan J. Algebra and Geometry with Applications 1 (2) (2022), 189–195.
  3. K. Adegoke, R. Frontczak and T. Goy, Reciprocal series involving Horadam numbers, Ukrainian Math. J. 75 (3) (2023), 335–346.
  4. R. André-Jeannin, Summation of reciprocals in certain second-order recurring sequences, Fibonacci Quart. 35 (1997), 68–74.
  5. M. Bataille, Solution to Problem H-912, Advanced Problems and Solutions, Fibonacci Quart. 62 (3) (2024), 267–269.
  6. B. A. Brousseau, Summation of infinite Fibonacci series, Fibonacci Quart. 7 (2) (1969), 143–168.
  7. B. A. Brousseau, Fibonacci-Lucas infinite series - research topic, Fibonacci Quart. 7 (2) (1969), 211–217. [CrossRef]
  8. P. S. Bruckman and I. J. Good, A generalization of a series of de Morgan, with applications of Fibonacci type, Fibonacci Quart. 14 (3) (1976), 193–196.
  9. B. Farhi, Summation of certain infinite Lucas-related series, J. Integer Seq. 22 (2019), Article 19.1.6.
  10. R. Frontczak, Closed-form evaluations of Fibonacci-Lucas reciprocal sums with three factors, Notes Number Theory Discr. Math. 23 (2017), 104–116.
  11. V. E. Hoggar JR., and M. Bicknell, A primer for the Fibonacci numbers, part XV. Variations on summing a series of reciprocals of Fibonacci numbers, Fibonacci Quart. 14 (3) (1976), 272–276.
  12. F. T. Howard, The sum of the squares of two generalized Fibonacci numbers, Fibonacci Quart. 41 (1) (2003), 80–84. [CrossRef]
  13. H. Hu, Z.-W. Sun, and J.-X. Liu, Reciprocal sums of second-order recurrent sequences, Fibonacci Quart. 39 (3) (2001), 214–220.
  14. E. Kılıç and D. Ersanlı, New reciprocal sums involving finite products of second order recursions, Miskolc Math. Notes. 20 (2) (2019), 1039–1050.
  15. R. S. Melham, Summation of reciprocals which involve products of terms from generalized Fibonacci sequences, Fibonacci Quart. 38 (3) (2000), 294–298.
  16. R. S. Melham, Summation of reciprocals which involve products of terms from generalized Fibonacci sequences - Part II, Fibonacci Quart. 39 (3) (2001), 264–267.
  17. R. S. Melham, Reduction Formulas for the summation of reciprocals in certain second-order recurring sequences, Fibonacci Quart. 40 (1) (2002), 71–75.
  18. R. S. Melham, On finite sums of Good and Shar that involve reciprocals of Fibonacci numbers, Integers 12 (2012), #A61.
  19. R. S. Melham, Finite sums that involve reciprocals of products of generalized Fibonacci numbers, Integers 13 (2013), #A40.
  20. R. S. Melham, More on finite sums that involve reciprocals of products of generalized Fibonacci numbers, Integers 14 (2014), #A4.
  21. R. S. Melham, Finite reciprocal sums involving summands that are balanced products of generalized Fibonacci numbers, J. Integer Seq. 17 (2014), Article 14.6.5.
  22. R. S. Melham, On certain families of finite reciprocal sums that involve generalized Fibonacci numbers, Fibonacci Quart. 53 (4) (2015), 323–334.
  23. R. S. Melham and A. G. Shannon, On reciprocal sums of Chebyshev related sequences, Fibonacci Quart. 33 (1995), 194–202.
  24. H. Ohtsuka, Solution to Problem H-818, Advanced Problems and Solutions, Fibonacci Quart. 58 (1) (2020), 92. The problem proposal appeared in Fibonacci Quart. 56 (1) (2018).
  25. H. Ohtsuka, Problem H-912, Advanced Problems and Solutions, Fibonacci Quart. 61 (1) (2023), 91.
  26. H. Ohtsuka, Problem H-938, Advanced Problems and Solutions, Fibonacci Quart. 62 (2) (2024), 181.
  27. A. Plaza, Problem H-951, Advanced Problems and Solutions, Fibonacci Quart. 63 (1) (2025), 123.
  28. S. Rabinowitz, Algorithmic Summation of Reciprocals of Products of Fibonacci Numbers, Fibonacci Quart. 37 (2) (1999), 122–127.
  29. S. Vajda, Fibonacci and Lucas Numbers, and the Golden Section: Theory and Applications, Dover Press, 2008.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated