sum of product of reciprocals of fibonacci numbersa thesis submitted in the partial fulfillment of...
TRANSCRIPT
![Page 1: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/1.jpg)
SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERS
A Thesis Submitted in the Partial Fulfillment of the Requirements of Degree
for
Integrated M.Sc.
In
Mathematics
Submitted by
Kappagantu Prudhavi Nag
Roll Number: 410MA5016
Under the Guidance of
Professor G. K. Panda
Department of Mathematics
National Institute of Technology, Rourkela
May 2015
![Page 2: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/2.jpg)
Page | 2
CERTIFICATE
Dr. Gopal Krishna Panda
Professor of Mathematics May 11, 2015
This is to certify that the project report with title “SUM OF PRODUCT OF RECIPROCALS OF
FIBONACCI NUMBERS” submitted by Mr. Kappagantu Prudhavi Nag, Roll No. 410MA5016, to
the National Institute of Technology, Rourkela, Odisha for the partial fulfillment of the
requirements of Integrated M.Sc. degree in Mathematics, is a bonafide research work carried
out by him under my supervision and guidance. The content of this report in full or part has not
been submitted to any other Institute or University for the award of any degree or diploma.
Gopal Krishna Panda
![Page 3: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/3.jpg)
Page | 3
ACKNOWLEDGEMENTS
I would like to express my special appreciation and thanks to my supervisor
Professor G. K. Panda who has been a great mentor for me. I thank him for his suggestion for
providing a beautiful problem in number theory.
I am grateful to Prof. Sunil Kumar Sarangi, Director, National Institute of Technology,
Rourkela for providing excellent facilities in the Institute for carrying out research.
I am thankful to the Head, mathematics and professors of department for their valuable
help during the preparation of this work.
There are no words to explain how grateful I am to my parents for all of their sacrifices
and prayers that they made for me. I also like to thank my brother who helped me in this
research and also gave a few ideas which helped me in successful completion of this project.
I also take this opportunity to thank all of my friends who helped me during the
preparation of this work.
Place: Rourkela
Date:
Kappagantu Prudhavi Nag
Department of Mathematics
National Institute of Technology Rourkela
![Page 4: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/4.jpg)
Page | 4
ABSTRACT
Fibonacci numbers are the number sequences which follow the linear mathematical
recurrence𝐹0 = 0, 𝐹1 = 1 and 𝐹𝑛 = 𝐹𝑛−1 + 𝐹𝑛−2 𝑛 ≥ 2. In this work, we study certain sum
formulas involving products of reciprocals of Fibonacci numbers. Sum formulas with
alternating signs are also studied.
![Page 5: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/5.jpg)
Page | 5
TABLE OF CONTENTS 1. Notations ............................................................................................................................................................6
2. Introduction ......................................................................................................................................................7
i. Mathematics of Fibonacci Numbers .............................................................................................................. 7
ii. Fibonacci Numbers with Negative Indices ................................................................................................ 8
3. Sum of Reciprocals of Fibonacci Numbers with Positive Indices ............................................. 11
i. Order 2 ......................................................................................................................................................................... 11
a. Non-Alternating Sum...................................................................................................................................... 11
b. Alternating Sum ................................................................................................................................................. 13
ii. Sum With Indices in A.P. .................................................................................................................................... 16
a. Non-Alternating Sum of Order 1 ............................................................................................................. 16
b. Alternating Sum of Order 1 ........................................................................................................................ 16
4. Sum of Reciprocals of Fibonacci Numbers with Negative Indices ............................................ 19
i. Order 1 ......................................................................................................................................................................... 19
a. Non-Alternating Sum...................................................................................................................................... 20
b. Alternating Sum ................................................................................................................................................. 20
ii. Order 2 ......................................................................................................................................................................... 20
a. Non-Alternating Sum...................................................................................................................................... 21
b. Alternating Sum ................................................................................................................................................. 21
iii. Sum with Indices in A.P. .................................................................................................................................... 22
a. Non-Alternating Sum of Order 1 ............................................................................................................. 23
b. Alternating Sum of Order 1 ........................................................................................................................ 24
5. References ...................................................................................................................................................... 26
![Page 6: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/6.jpg)
Page | 6
NOTATIONS The following notations will be frequently used in this thesis.
𝔽𝑁 = ∑1
𝐹𝑛
𝑁𝑛=1
𝔾𝑁 = ∑(−1)𝑛
𝐹𝑛
𝑁𝑛=1
𝔽𝑁(𝑎) = ∑1
𝐹𝑛+𝑎
𝑁𝑛=1
𝔾𝑁(𝑎) = ∑(−1)𝑛
𝐹𝑛+𝑎
𝑁𝑛=1
𝔽𝑁ℎ = ∑
1
𝐹ℎ𝑛
𝑁𝑛=1
𝔾𝑁ℎ = ∑
(−1)𝑛
𝐹ℎ𝑛
𝑁𝑛=1
ℍ𝑁 = ∑1
𝐹−𝑛
𝑁𝑛=1
𝕀𝑁 = ∑(−1)𝑛
𝐹−𝑛
𝑁𝑛=1
ℍ𝑁(𝑎) = ∑1
𝐹−𝑛−𝑎
𝑁𝑛=1
𝕀𝑁(𝑎) = ∑1
𝐹−𝑛−𝑎
𝑁𝑛=1
ℍ𝑁(0, 𝑎) = ∑1
𝐹−𝑛𝐹−𝑛−𝑎
𝑁𝑛=1
𝕀𝑁(0, 𝑎) = ∑(−1)𝑛
𝐹−𝑛𝐹−𝑛−𝑎
𝑁𝑛=1
ℍ𝑁(𝑎, 𝑏) = ∑1
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁𝑛=1
𝕀𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁𝑛=1
ℍ𝑁ℎ = ∑
1
𝐹−ℎ𝑛
𝑁𝑛=1
𝕀𝑁ℎ = ∑
(−1)𝑛
𝐹−ℎ𝑛
𝑁𝑛=1
ℍ𝑁ℎ (𝑎) = ∑
1
𝐹−ℎ𝑛−𝑎
𝑁𝑛=1
𝕀𝑁ℎ (𝑎) = ∑
(−1)𝑛
𝐹−ℎ𝑛−𝑎
𝑁𝑛=1
![Page 7: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/7.jpg)
Page | 7
CHAPTER 1
INTRODUCTION
Fibonacci sequence of numbers is one of the most intriguing number sequence in
mathematics. The series is named after the famous Italian Mathematician Fibonacci of the
Bonacci family. He is also known as the Leonardo of Pisa. The following problem proposed by
Fibonacci himself gave birth to the sequence.
The Fibonacci Problem: Suppose there are two newborn rabbits, one male and one female.
Find the number of rabbits produced in a year if [1]
Each pair takes one month to become mature
Each pair produces a mixed pair every month from the second month
All rabbits are immortal
Solution: For convenience let us assume that the rabbits are born on January 1st and we need
to find the number of rabbits on December 1st. The table below is used to find the solution of
the problem.
From the above table it is evident that the number of rabbits at the end of the year are
144. If observed closely it is observed that the new number is equal to the sum of the previous
two numbers.
MATHEMATICS OF FIBONACCI NUMBERS
The numbers in the bottom row are called the Fibonacci numbers. From the table a
recursive relation is yielded as below
𝐹𝑛 = 𝐹𝑛−1 + 𝐹𝑛−2 , 𝑛 ≥ 2.
where 𝐹0 = 0 and 𝐹1 = 1 [2]. Sometimes it is customary to start the Fibonacci numbers from 𝐹1
instead of 𝐹0. Then the initial two conditions become 𝐹1 = 1 and 𝐹2 = 1. With any of the above
two conditions the series generated is the same.
No. of Pairs Jan Feb Mar April May June July Aug Sep Oct Nov Dec
Adults 0 1 1 2 3 5 8 13 21 34 55 89
Babies 1 0 1 1 2 3 5 8 13 21 34 34
Total 1 1 2 3 5 8 13 21 34 55 89 144
![Page 8: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/8.jpg)
Page | 8
It is surprising that Fibonacci numbers can be extracted from Pascal’s triangle. The
above observation was confirmed by Lucas in 1876 when he derived a straightforward formula
to find the Fibonacci numbers [1]
𝐹𝑛 = ∑ (𝑛 − 𝑖 − 1
𝑖)
⌊(𝑛−1) 2⁄ ⌋
𝑖=0
, 𝑛 ≥ 1.
In 1843 a French mathematician named Jacques Philippe Marie Binet invented a way to
calculate the 𝑛𝑡ℎ Fibonacci numbers. If 𝜙 =1+√5
2 and 𝜓 =
1−√5
2 then 𝐹𝑛 =
𝜙𝑛−𝜓𝑛
√5 [3].
The above formula shows an interesting aspect that the Fibonacci number can be
written in terms of the golden ratio. Fibonacci numbers appear in many places in both nature
and mathematics. They occur in music, geography, nature, and geometry. They can be found in
the spiral arrangements of seeds of sunflowers, the scale patterns of pine cones, the
arrangement of leaves and the number of petals on the flower.
FIBONACCI NUMBERS WITH NEGATIVE INDICES
The negative subscript of the Fibonacci numbers can be converted to positive subscript
as indicated in [4]. The recurrence relation for the negative Fibonacci numbers is as follows:
𝐹−𝑛 = 𝐹2−𝑛 − 𝐹1−𝑛, 𝑛 ≥ 2
The initial conditions for these numbers are 𝐹0 = 0 and 𝐹1 = 1. It is observed that the
negative Fibonacci numbers have the same initial conditions as of the positive Fibonacci
numbers.
Rabinowitz [5] stated that the alternating general summation of order 1 is given by
𝔾𝑁(𝑎) = ∑(−1)𝑛
𝐹𝑛+𝑎
𝑁
𝑛=1
= 𝔾𝑁+𝑎 − 𝔾𝑎.
We disprove the above identity using a counter example.
Now let us take 𝑎 = 3 and 𝑁 = 5 and find the value of 𝔾𝑁(𝑎).
∑(−1)𝑛
𝐹𝑛+3
5
𝑛=1
=−1
𝐹4+1
𝐹5+−1
𝐹6+1
𝐹7+−1
𝐹8
𝔾8 =−1
𝐹1+1
𝐹2+−1
𝐹3+1
𝐹4+−1
𝐹5+1
𝐹6+−1
𝐹7+1
𝐹8
![Page 9: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/9.jpg)
Page | 9
𝔾3 =−1
𝐹1+1
𝐹2+−1
𝐹3
𝔾𝑁+𝑎 − 𝔾𝑎 =1
𝐹4+−1
𝐹5+1
𝐹6+−1
𝐹7+1
𝐹8≠ 𝔾𝑁(𝑎).
It can be checked that the identity for 𝔾𝑁(𝑎) is wrong when 𝑎 is odd and correct when 𝑎 is even.
Claim: If 𝑎 > 0 then 𝔾𝑁(𝑎) = {𝔾𝑎 − 𝔾𝑁+𝑎 if 𝑎 is odd,𝔾𝑁+𝑎 − 𝔾𝑎 if 𝑎 is even.
Proof:
𝔾𝑁+𝑎 − 𝔾𝑎 = ∑(−1)𝑛
𝐹𝑛
𝑁+𝑎
𝑛=1
−∑(−1)𝑛
𝐹𝑛
𝑎
𝑛=1
= ∑(−1)𝑛
𝐹𝑛
𝑁+𝑎
𝑛=𝑎+1
.
Case 1. 𝑎 is odd, 𝑁 is odd
𝔾𝑁(𝑎) = ∑(−1)𝑛
𝐹𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
1
𝐹(𝑁−1)+𝑎+−1
𝐹𝑁+𝑎.
𝔾𝑁+𝑎 − 𝔾𝑎 = ∑(−1)𝑛
𝐹𝑛
𝑁+𝑎
𝑛=𝑎+1
=1
𝐹1+𝑏+−1
𝐹2+𝑎+⋯+
−1
𝐹(𝑁−1)+𝑎+
1
𝐹𝑁+𝑎
= −(−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
1
𝐹(𝑁−1)+𝑎+−1
𝐹𝑁+𝑎)
= −𝔾𝑁(𝑎).
Case 2. 𝑎 is odd, 𝑁 is even
𝔾𝑁(𝑎) = ∑(−1)𝑛
𝐹𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
−1
𝐹(𝑁−1)+𝑎+
1
𝐹𝑁+𝑎.
𝔾𝑁+𝑎 − 𝔾𝑏 = ∑(−1)𝑛
𝐹𝑛
𝑁+𝑎
𝑛=𝑎+1
=1
𝐹1+𝑎+−1
𝐹2+𝑎+⋯+
1
𝐹(𝑁−1)+𝑎+−1
𝐹𝑁+𝑎
= −(−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
−1
𝐹(𝑁−1)+𝑎+
1
𝐹𝑁+𝑎)
= −𝔾𝑁(𝑎).
![Page 10: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/10.jpg)
Page | 10
Case 3. 𝑎 is even , 𝑁 is odd
𝔾𝑁(𝑎) = ∑(−1)𝑛
𝐹𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
1
𝐹(𝑁−1)+𝑎+−1
𝐹𝑁+𝑎.
𝔾𝑁+𝑎 − 𝔾𝑏 = ∑(−1)𝑛
𝐹𝑛
𝑁+𝑎
𝑛=𝑎+1
=−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
1
𝐹(𝑁−1)+𝑎+−1
𝐹𝑁+𝑎
= 𝔾𝑁 (𝑎).
Case 4. 𝑎 is even , 𝑁 is even
𝔾𝑁(𝑎) = ∑(−1)𝑛
𝐹𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
−1
𝐹(𝑁−1)+𝑎+
1
𝐹𝑁+𝑎.
𝔾𝑁+𝑎 − 𝔾𝑏 = ∑(−1)𝑛
𝐹𝑛
𝑁+𝑎
𝑛=𝑎+1
=−1
𝐹1+𝑎+
1
𝐹2+𝑎+⋯+
−1
𝐹(𝑁−1)+𝑎+
1
𝐹𝑁+𝑎
= 𝔾𝑁 (𝑎).
∎
![Page 11: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/11.jpg)
Page | 11
CHAPTER 2
SUM OF RECIPROCALS OF FIBONACCI NUMBERS WITH
POSITIVE INDICES
The following notations for the alternating and non-alternating sum of 𝑘𝑡ℎ order are available
in [5].
𝑆(𝑎1, 𝑎2, … , 𝑎𝑘−1, 𝑎𝑘 ) = ∑1
𝐹𝑛+𝑎1𝐹𝑛+𝑎2…𝐹𝑛+𝑎𝑘
𝑁
𝑛=1
𝑇(𝑎1, 𝑎2, … , 𝑎𝑘−1, 𝑎𝑘 ) = ∑(−1)𝑛
𝐹𝑛+𝑎1𝐹𝑛+𝑎2…𝐹𝑛+𝑎𝑘
𝑁
𝑛=1
The sum 𝑆 is called the non-alternating summation of order 𝑘. The second sum 𝑇 is called the
alternating sum of order 𝑘. In both the cases 0 < 𝑎1 < 𝑎2 < ⋯ < 𝑎𝑘−1 < 𝑎𝑘.
ORDER 2
We consider first the problem of finding the following second order sums.
𝔽𝑁(𝑎, 𝑏 ) = ∑1
𝐹𝑛+𝑎𝐹𝑛+𝑏
𝑁
𝑛=1
𝔾𝑁(𝑎, 𝑏 ) = ∑(−1)𝑛
𝐹𝑛+𝑎𝐹𝑛+𝑏
𝑁
𝑛=1
NON-ALTERNATING SUM
For 𝑎 > 0, Rabinowitz [5] got the following formula.
𝔽𝑁(0, 𝑎) = ∑1
𝐹𝑛𝐹𝑛+𝑎=
{
1
𝐹𝑎∑ (
1
𝐹𝑁+2𝑖𝐹𝑁+2𝑖+1−
1
𝐹2𝑖𝐹2𝑖+1)
⌊𝑎 2⁄ ⌋
𝑖=1
+𝕂𝑁𝐹𝑎 if 𝑎 is odd,
1
𝐹𝑎∑(
1
𝐹2𝑖−1𝐹2𝑖−
1
𝐹𝑁+2𝑖−1𝐹𝑁+2𝑖)
𝑎 2⁄
𝑖=1
if 𝑎 is even.
𝑁
𝑛=1
where 𝕂𝑁 = ∑1
𝐹𝑛𝐹𝑛+1
𝑁𝑖=1 . The above sum is called the non-alternating sum of order 2. The aim is
to find an equivalent expression of 𝔽𝑁(𝑎, 𝑏). To do this we use the help of the following result.
![Page 12: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/12.jpg)
Page | 12
𝑇ℎ𝑒𝑜𝑟𝑒𝑚 1: 𝐹𝑜𝑟 0 < 𝑎 < 𝑏 𝑡ℎ𝑒𝑛 𝐹𝑁 (𝑎, 𝑏) = 𝐹𝑁+𝑎 (0, 𝑏 − 𝑎) − 𝐹𝑎 (0, 𝑏 − 𝑎).
𝑃𝑟𝑜𝑜𝑓: We start from the right hand side of the equation and come to the left hand side.
𝔽𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔽𝑎(0, 𝑏 − 𝑎) = ∑1
𝐹𝑛𝐹𝑛+𝑏−𝑎−∑
1
𝐹𝑛𝐹𝑛+𝑏−𝑎
𝑎
𝑖=1
𝑁+𝑎
𝑛=1
= ∑1
𝐹𝑛𝐹𝑛+𝑏−𝑎
𝑁+𝑎
𝑛=𝑎+1
=1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1+
1
𝐹𝑁+𝑎𝐹𝑁+𝑏
= ∑1
𝐹𝑛+𝑎𝐹𝑛+𝑏
𝑁
𝑛=1
= 𝔽𝑁(𝑎, 𝑏)
∎
By using the above theorem and the formula for 𝔽𝑁(0, 𝑎) stated by Rabinowitz [5] the
expression for 𝔽𝑁(𝑎, 𝑏) is calculated.
𝑇ℎ𝑒𝑜𝑟𝑒𝑚 2: 𝐼𝑓 0 < 𝑎 < 𝑏 𝑡ℎ𝑒𝑛
𝔽𝑁(𝑎, 𝑏) =
{
1
𝐹𝑏−𝑎∑ (
1
𝐹𝑁+𝑎+2𝑖𝐹𝑁+𝑎+2𝑖+1−
1
𝐹𝑎+2𝑖𝐹𝑎+2𝑖+1)
⌊(𝑏−𝑎) 2⁄ ⌋
𝑖=1
+𝔽𝑁(𝑎, 𝑎 + 1)
𝐹𝑏−𝑎 if (𝑏 − 𝑎)is odd,
1
𝐹𝑏−𝑎∑ (
1
𝐹𝑎+2𝑖−1𝐹𝑎+2𝑖−
1
𝐹𝑁+𝑎+2𝑖−1𝐹𝑁+𝑎+2𝑖)
(𝑏−𝑎) 2⁄
𝑖=1
if (𝑏 − 𝑎)is even.
𝑃𝑟𝑜𝑜𝑓: We take the help of Theorem 1 to prove this theorem.
𝔽𝑁+𝑎(0, 𝑏 − 𝑎) =
{
1
𝐹𝑏−𝑎∑ (
1
𝐹𝑁+𝑎+2𝑖𝐹𝑁+𝑎+2𝑖+1−
1
𝐹2𝑖𝐹2𝑖+1)
⌊(𝑏−𝑎) 2⁄ ⌋
𝑖=1
+𝕂𝑁+𝑎𝐹𝑏−𝑎
if (𝑏 − 𝑎) is odd,
1
𝐹𝑏−𝑎∑ (
1
𝐹2𝑖−1𝐹2𝑖−
1
𝐹𝑁+𝑎+2𝑖−1𝐹𝑁+𝑎+2𝑖)
𝑏(𝑏−𝑎) 2⁄ −𝑎2⁄
𝑖=1
if (𝑏 − 𝑎) is even.
𝔽𝑎(0, 𝑏 − 𝑎) =
{
1
𝐹𝑏−𝑎∑ (
1
𝐹𝑎+2𝑖𝐹𝑎+2𝑖+1−
1
𝐹2𝑖𝐹2𝑖+1)
⌊(𝑏−𝑎) 2⁄ ⌋
𝑖=1
+𝕂𝑎𝐹𝑏−𝑎
if (𝑏 − 𝑎) is odd,
1
𝐹𝑏−𝑎∑ (
1
𝐹2𝑖−1𝐹2𝑖−
1
𝐹𝑎+2𝑖−1𝐹𝑎+2𝑖)
(𝑏−𝑎) 2⁄
𝑖=1
if (𝑏 − 𝑎) is even.
Depending upon the parity of (𝑏 − 𝑎), two different cases are taken into consideration
![Page 13: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/13.jpg)
Page | 13
Case 1. (𝒃 − 𝒂) 𝐢𝐬 𝐨𝐝𝐝
In this case,
𝔽𝑁(𝑎, 𝑏) =1
𝐹𝑏−𝑎∑ (
1
𝐹𝑁+𝑎+2𝑖𝐹𝑁+𝑎+2𝑖+1−
1
𝐹2𝑖𝐹2𝑖+1−
1
𝐹𝑎+2𝑖𝐹𝑎+2𝑖+1+
1
𝐹2𝑖𝐹2𝑖+1)
⌊(𝑏−𝑎) 2⁄ ⌋
𝑖=1
+𝕂𝑁+𝑎 −𝕂𝑎
𝐹𝑏−𝑎
=1
𝐹𝑏−𝑎∑ (
1
𝐹𝑁+𝑎+2𝑖𝐹𝑁+𝑎+2𝑖+1−
1
𝐹𝑎+2𝑖𝐹𝑎+2𝑖+1) +
𝕂𝑁+𝑎 −𝕂𝑎 𝐹𝑏−𝑎
.
⌊(𝑏−𝑎) 2⁄ ⌋
𝑖=1
Now,
𝕂𝑁+𝑎 − 𝕂𝑁 = ∑1
𝐹𝑛𝐹𝑛+1
𝑁+𝑎
𝑛=1
−∑1
𝐹𝑛𝐹𝑛+1
𝑎
𝑛=1
= ∑1
𝐹𝑛𝐹𝑛+1
𝑁+𝑎
𝑛=𝑎+1
=∑1
𝐹𝑛+𝑎𝐹𝑛+𝑎+1= 𝔽𝑁(𝑎, 𝑎 + 1)
𝑁
𝑛=1
𝔽𝑁(𝑎, 𝑏) =1
𝐹𝑏−𝑎∑ (
1
𝐹𝑁+𝑎+2𝑖𝐹𝑁+𝑎+2𝑖+1−
1
𝐹𝑎+2𝑖𝐹𝑎+2𝑖+1)
⌊(𝑏−𝑎) 2⁄ ⌋
𝑖=1
+𝔽𝑁(𝑎, 𝑎 + 1)
𝐹𝑏−𝑎 .
Case 2. (𝑏 − 𝑎) is even
𝔽𝑁(𝑎, 𝑏) =1
𝐹𝑏−𝑎∑ (
1
𝐹2𝑖−1𝐹2𝑖−
1
𝐹𝑁+𝑎+2𝑖−1𝐹𝑁+𝑎+2𝑖−
1
𝐹2𝑖−1𝐹2𝑖−
1
𝐹𝑎+2𝑖−1𝐹𝑎+2𝑖)
(𝑏−𝑎) 2⁄
𝑖=1
=1
𝐹𝑏−𝑎∑ (
1
𝐹𝑎+2𝑖−1𝐹𝑎+2𝑖−
1
𝐹𝑁+𝑎+2𝑖−1𝐹𝑁+𝑎+2𝑖)
(𝑏−𝑎) 2⁄
𝑖=1
.
∎
ALTERNATING SUM
Let 𝑎 > 0 . The following identity is available in from [6].
𝔾𝑁(0, 𝑎) = ∑(−1)𝑛
𝐹𝑛𝐹𝑛+𝑎=1
𝐹𝑎∑(
𝐹𝑗−1
𝐹𝑗−𝐹𝑁+𝑗−1
𝐹𝑁+𝑗)
𝑎
𝑗=1
𝑁
𝑛=1
.
The above is a sum with alternating sign (called an alternating sum) of order 2. We use the
above sum to find a formula for 𝔾𝑁(𝑎, 𝑏). To achieve this, we use of the following result.
𝑇ℎ𝑒𝑜𝑟𝑒𝑚 3: 𝐼𝑓 0 < 𝑎 < 𝑏 𝑡ℎ𝑒𝑛
𝔾𝑁(𝑎, 𝑏) = {𝔾𝑎(0, 𝑏 − 𝑎) − 𝔾𝑁+𝑎(0, 𝑏 − 𝑎) if 𝑎 is odd,
𝔾𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔾𝑎(0, 𝑏 − 𝑎) if 𝑎 is even.
𝑃𝑟𝑜𝑜𝑓: Observe that
![Page 14: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/14.jpg)
Page | 14
𝔾𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔾𝑎(0, 𝑏 − 𝑎) = ∑(−1)𝑛
𝐹𝑁𝐹𝑛+𝑏−𝑎
𝑁+𝑎
𝑛=1
−∑(−1)𝑛
𝐹𝑁𝐹𝑛+𝑏−𝑎
𝑎
𝑛=1
= ∑(−1)𝑛
𝐹𝑛𝐹𝑛+𝑏−𝑎.
𝑁+𝑎
𝑛=𝑎+1
We distinguish four cases:
Case 1. 𝑎 and 𝑁 are odd
𝔾𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹𝑛+𝑎𝐹𝑛+𝑏=
−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1
𝑁
𝑛=1
+−1
𝐹𝑁+𝑎𝐹𝑁+𝑏.
𝔾𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔾𝑎(0, 𝑏 − 𝑎) = ∑(−1)𝑛
𝐹𝑛𝐹𝑛+𝑏−𝑎
𝑁+𝑎
𝑛=𝑎+1
=1
𝐹𝑎+1𝐹𝑏+2+
−1
𝐹𝑎+2𝐹𝑏+3+⋯+
−1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1+
1
𝐹𝑁+𝑎𝐹𝑁+𝑏
= −(−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1+
−1
𝐹𝑁+𝑎𝐹𝑁+𝑏)
= −𝔾𝑁(𝑎, 𝑏).
Case 2. 𝑎 is odd and 𝑁 is even
𝔾𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹𝑛+𝑎𝐹𝑛+𝑏=
−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
−1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1
𝑁
𝑛=1
+1
𝐹𝑁+𝑎𝐹𝑁+𝑏.
𝔾𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔾𝑎(0, 𝑏 − 𝑎) = ∑(−1)𝑛
𝐹𝑛𝐹𝑛+𝑏−𝑎
𝑁+𝑎
𝑛=𝑎+1
=1
𝐹𝑎+1𝐹𝑏+2+
−1
𝐹𝑎+2𝐹𝑏+3+⋯+
1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1+
−1
𝐹𝑁+𝑎𝐹𝑁+𝑏
= −(−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
−1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1++
1
𝐹𝑁+𝑎𝐹𝑁+𝑏)
= −𝔾𝑁(𝑎, 𝑏).
Case 3. 𝑎 is even and 𝑁 is odd
𝔾𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹𝑛+𝑎𝐹𝑛+𝑏=
−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1
𝑁
𝑛=1
+−1
𝐹𝑁+𝑎𝐹𝑁+𝑏.
𝔾𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔾𝑎(0, 𝑏 − 𝑎) = ∑(−1)𝑛
𝐹𝑛𝐹𝑛+𝑏−𝑎
𝑁+𝑎
𝑛=𝑎+1
=−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1++
−1
𝐹𝑁+𝑎𝐹𝑁+𝑏
![Page 15: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/15.jpg)
Page | 15
= 𝔾𝑁(𝑎, 𝑏).
Case 4. 𝑎 and 𝑁 are even
𝔾𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹𝑛+𝑎𝐹𝑛+𝑏=
−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
−1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1
𝑁
𝑛=1
+1
𝐹𝑁+𝑎𝐹𝑁+𝑏
𝔾𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔾𝑎(0, 𝑏 − 𝑎) = ∑(−1)𝑛
𝐹𝑛𝐹𝑛+𝑏−𝑎
𝑁+𝑎
𝑛=𝑎+1
=−1
𝐹𝑎+1𝐹𝑏+1+
1
𝐹𝑎+2𝐹𝑏+2+⋯+
−1
𝐹𝑁+𝑎−1𝐹𝑁+𝑏−1++
1
𝐹𝑁+𝑎𝐹𝑁+𝑏
= 𝔾𝑁(𝑎, 𝑏).
∎
The following theorem is one of the main results of this chapter.
𝑇ℎ𝑒𝑜𝑟𝑒𝑚 4: 𝐼𝑓 0 < 𝑎 < 𝑏 𝑡ℎ𝑒𝑛
𝔾𝑁(𝑎, 𝑏) =
{
1
𝐹𝑏−𝑎∑(
𝐹𝑁+𝑎+𝑗−1
𝐹𝑁+𝑎+𝑗−𝐹𝑎+𝑗−1
𝐹𝑎+𝑗)
𝑏−𝑎
𝑗=1
if 𝑎 is odd,
1
𝐹𝑏−𝑎∑(
𝐹𝑎+𝑗−1
𝐹𝑎+𝑗−𝐹𝑁+𝑎+𝑗−1
𝐹𝑁+𝑎+𝑗)
𝑏−𝑎
𝑗=1
if 𝑎 is even.
𝑃𝑟𝑜𝑜𝑓: We separate two cases:
Case 1. 𝑎 is odd
𝔾𝑎(0, 𝑏 − 𝑎) − 𝔾𝑁+𝑎(0, 𝑏 − 𝑎) =1
𝐹𝑏−𝑎∑(
𝐹𝑗−1𝐹𝑗
−𝐹𝑎+𝑗−1𝐹𝑎+𝑗
)
𝑏−𝑎
𝑗=1
−1
𝐹𝑏−𝑎∑(
𝐹𝑗−1𝐹𝑗
−𝐹𝑁+𝑎+𝑗−1𝐹𝑁+𝑎+𝑗
)
𝑏−𝑎
𝑗=1
=1
𝐹𝑏−𝑎∑(
𝐹𝑁+𝑎+𝑗−1𝐹𝑁+𝑎+𝑗
−𝐹𝑎+𝑗−1𝐹𝑎+𝑗
)
𝑏−𝑎
𝑗=1
.
Case 2. 𝑎 is even
𝔾𝑁+𝑎(0, 𝑏 − 𝑎) − 𝔾𝑎(0, 𝑏 − 𝑎) =1
𝐹𝑏−𝑎∑(
𝐹𝑗−1𝐹𝑗
−𝐹𝑁+𝑎+𝑗−1𝐹𝑁+𝑎+𝑗
)
𝑏−𝑎
𝑗=1
−1
𝐹𝑏−𝑎∑(
𝐹𝑗−1𝐹𝑗
−𝐹𝑎+𝑗−1𝐹𝑎+𝑗
)
𝑏−𝑎
𝑗=1
=1
𝐹𝑏−𝑎∑(
𝐹𝑎+𝑗−1𝐹𝑎+𝑗
−𝐹𝑁+𝑎+𝑗−1𝐹𝑁+𝑎+𝑗
) .
𝑏−𝑎
𝑗=1
∎
![Page 16: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/16.jpg)
Page | 16
SUM WITH INDICES IN A.P.
Let ℎ be a natural number. We express certain sums in terms of the following two sums.
𝔽𝑁ℎ = ∑
1
𝐹ℎ𝑛
𝑁
𝑛=1
, 𝔾𝑁ℎ =∑
(−1)𝑛
𝐹ℎ𝑛
𝑁
𝑛=1
NON-ALTERNATING SUM OF ORDER 1
We consider the problem of finding 𝔽𝑁ℎ (𝑎) in terms of 𝔽𝑁
ℎ .
𝑇ℎ𝑒𝑜𝑟𝑒𝑚 5: 𝐼𝑓 𝑎 > 0 𝑎𝑛𝑑 ℎ|𝑎 𝑡ℎ𝑒𝑛 𝔽𝑁ℎ (𝑎) = 𝔽
𝑁+𝑎
ℎ
ℎ− 𝔽𝑎
ℎ
ℎ .
𝑃𝑟𝑜𝑜𝑓: Let 𝑏 =𝑎
ℎ and 𝑎 = 𝑏ℎ then,
𝔽𝑁+
𝑎ℎ
ℎ − 𝔽𝑎ℎ
ℎ = ∑1
𝐹ℎ𝑛
𝑁+𝑏
𝑛=1
−∑1
𝐹ℎ𝑛
𝑏
𝑛=1
= ∑1
𝐹ℎ𝑛
𝑁+𝑏
𝑛=𝑏+1
= 1
𝐹ℎ(𝑏+1)+
1
𝐹ℎ(𝑏+2)+⋯+
1
𝐹ℎ(𝑁+𝑏−1)+
1
𝐹ℎ(𝑁+𝑏)
= 1
𝐹ℎ+𝑎+
1
𝐹2ℎ+𝑎+⋯+
1
𝐹(𝑁−1)ℎ+𝑎+
1
𝐹𝑁ℎ+𝑎
= 𝔽𝑁ℎ (𝑎).
∎
ALTERNATING SUM OF ORDER 1
We consider the problem of finding 𝔾𝑁ℎ (𝑎) in terms of 𝔾𝑁
ℎ .
𝑇ℎ𝑒𝑜𝑟𝑒𝑚 6: 𝐼𝑓 𝑎 > 0 𝑎𝑛𝑑 ℎ|𝑎 𝑡ℎ𝑒𝑛
𝔾𝑁ℎ (𝑎) = {
𝔾𝑎ℎ
ℎ − 𝔾𝑁+
𝑎ℎ
ℎ if 𝑎 is odd,
𝔾𝑁+
𝑎ℎ
ℎ −𝔾𝑎ℎ
ℎ if 𝑎 is even.
Proof: Let 𝑏 =𝑎
ℎ and 𝑎 = 𝑏ℎ then,
𝔾𝑁+𝑏ℎ − 𝔾𝑏
ℎ = ∑(−1)𝑛
𝐹ℎ𝑛
𝑁+𝑏
𝑛=1
−∑(−1)𝑛
𝐹ℎ𝑛
𝑏
𝑛=1
= ∑(−1)𝑛
𝐹ℎ𝑛
𝑁+𝑏
𝑛=𝑏+1
.
Once again we distinguish four cases.
Case 1. 𝑏 =𝑎
ℎ and 𝑁 are odd.
![Page 17: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/17.jpg)
Page | 17
𝔾𝑁ℎ (𝑎) = ∑
(−1)𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹ℎ+𝑎+
1
𝐹2ℎ+𝑎+⋯+
1
𝐹(𝑁−1)ℎ+𝑎+
−1
𝐹𝑁ℎ+𝑎.
𝔾𝑁+𝑏ℎ −𝔾𝑏
ℎ = ∑(−1)𝑛
𝐹ℎ𝑛
𝑁+𝑏
𝑛=𝑏+1
=1
𝐹ℎ+ℎ𝑏+
−1
𝐹2ℎ+ℎ𝑏+⋯+
−1
𝐹(𝑁−1)ℎ+ℎ𝑏+
1
𝐹𝑁ℎ+ℎ𝑏
=1
𝐹ℎ+𝑎+
−1
𝐹2ℎ+𝑎+⋯+
−1
𝐹(𝑁−1)ℎ+𝑎+
−1
𝐹𝑁ℎ+𝑎
= −(−1
𝐹ℎ+𝑎+
1
𝐹2ℎ+𝑎+⋯+
1
𝐹(𝑁−1)ℎ+𝑎+
−1
𝐹𝑁ℎ+𝑎)
= −𝔾𝑁ℎ (𝑎).
Case 2. 𝑏 =𝑎
ℎ is odd, 𝑁 is even
𝔾𝑁ℎ (𝑎) = ∑
(−1)𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹ℎ+𝑎+
1
𝐹2ℎ+𝑎+⋯+
−1
𝐹(𝑁−1)ℎ+𝑎+
1
𝐹𝑁ℎ+𝑎.
𝔾𝑁+𝑏ℎ −𝔾𝑏
ℎ = ∑(−1)𝑛
𝐹ℎ𝑛
𝑁+𝑏
𝑛=𝑏+1
=1
𝐹ℎ+ℎ𝑏+
−1
𝐹2ℎ+ℎ𝑏+⋯+
1
𝐹(𝑁−1)ℎ+ℎ𝑏+
−1
𝐹𝑁ℎ+ℎ𝑏
=1
𝐹ℎ+𝑎+
−1
𝐹2ℎ+𝑎+⋯+
1
𝐹(𝑁−1)ℎ+𝑎+
−1
𝐹𝑁ℎ+𝑎
= −(−1
𝐹ℎ+𝑎+
1
𝐹2ℎ+𝑎+⋯+
1
𝐹(𝑁−1)ℎ+𝑎+
−1
𝐹𝑁ℎ+𝑎)
= −𝔾𝑁ℎ (𝑎)
Case 3. 𝑏 =𝑎
ℎ is even , 𝑁 is odd
𝔾𝑁ℎ (𝑎) = ∑
(−1)𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹ℎ+𝑎+
1
𝐹2ℎ+𝑎+⋯+
1
𝐹(𝑁−1)ℎ+𝑎+
−1
𝐹𝑁ℎ+𝑎.
𝔾𝑁+𝑏ℎ − 𝔾𝑏
ℎ = ∑(−1)𝑛
𝐹ℎ𝑛
𝑁+𝑏
𝑛=𝑏+1
=−1
𝐹ℎ+ℎ𝑏+
1
𝐹2ℎ+ℎ𝑏+⋯+
1
𝐹(𝑁−1)ℎ+ℎ𝑏+
−1
𝐹𝑁ℎ+ℎ𝑏
=1
𝐹ℎ+𝑎+
−1
𝐹2ℎ+𝑎+⋯+
1
𝐹(𝑁−1)ℎ+𝑎+
−1
𝐹𝑁ℎ+𝑎
= 𝔾𝑁ℎ (𝑎).
![Page 18: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/18.jpg)
Page | 18
Case 4. 𝑏 =𝑎
ℎ and 𝑁 are even
𝔾𝑁ℎ (𝑎) = ∑
(−1)𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
=−1
𝐹ℎ+𝑎+
1
𝐹2ℎ+𝑎+⋯+
−1
𝐹(𝑁−1)ℎ+𝑎+
1
𝐹𝑁ℎ+𝑎.
𝔾𝑁+𝑏ℎ − 𝔾𝑏
ℎ = ∑(−1)𝑛
𝐹ℎ𝑛
𝑁+𝑏
𝑛=𝑏+1
=−1
𝐹ℎ+ℎ𝑏+
1
𝐹2ℎ+ℎ𝑏+⋯+
−1
𝐹(𝑁−1)ℎ+ℎ𝑏+
1
𝐹𝑁ℎ+ℎ𝑏
=1
𝐹ℎ+𝑎+
−1
𝐹2ℎ+𝑎+⋯+
−1
𝐹(𝑁−1)ℎ+𝑎+
1
𝐹𝑁ℎ+𝑎
= 𝔾𝑁ℎ (𝑎).
∎
![Page 19: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/19.jpg)
Page | 19
CHAPTER 3
SUM OF RECIPROCALS OF FIBONACCI NUMBERS WITH
NEGATIVE INDICES
We use the conversion of negative Fibonacci numbers with negative indices to Fibonacci
numbers with positive indices and then derive the identities for these numbers. We use the
following notations.
ℍ𝑁 = ∑1
𝐹−𝑛
𝑁
𝑛=1
, 𝕀𝑁 = ∑(−1)𝑛
𝐹−𝑛
𝑁
𝑛=1
We first write them in terms of 𝔽𝑁 and 𝔾𝑁. We use the formula
𝐹−𝑛 = (−1)𝑛+1𝐹𝑛
stated in [3]. Then we have
ℍ𝑁 = ∑1
𝐹−𝑛
𝑁
𝑛=1
= ∑1
(−1)𝑛+1𝐹𝑛=
𝑁
𝑛=1
∑(−1)𝑛+1
𝐹𝑛
𝑁
𝑛=1
= −∑(−1)𝑛
𝐹𝑛
𝑁
𝑛=1
= −𝔾𝑁 ,
𝕀𝑁 = ∑(−1)𝑛
𝐹−𝑛
𝑁
𝑛=1
= ∑(−1)𝑛
(−1)𝑛+1𝐹𝑛=
𝑁
𝑛=1
∑(−1)1
𝐹𝑛
𝑁
𝑛=1
= −∑1
𝐹𝑛
𝑁
𝑛=1
= −𝔽𝑁 .
∎
ORDER 1 We first consider the following sums:
ℍ𝑁(𝑎) = ∑1
𝐹−𝑛−𝑎
𝑁
𝑛=1
,
𝕀𝑁(𝑎) = ∑(−1)𝑛
𝐹−𝑛−𝑎
𝑁
𝑛=1
.
We write the above in terms of 𝔽𝑁(𝑎) and 𝔾𝑁(𝑎).
![Page 20: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/20.jpg)
Page | 20
NON-ALTERNATING SUM
The non-alternating sum of Fibonacci numbers of negative indices of 1st order is,
ℍ𝑁(𝑎) = ∑1
𝐹−𝑛−𝑎
𝑁
𝑛=1
.
We write this sum in terms of 𝔾𝑁(𝑎) .
ℍ𝑁(𝑎) = ∑1
𝐹−𝑛−𝑎
𝑁
𝑛=1
= ∑1
(−1)𝑛+𝑎+1𝐹𝑛=
𝑁
𝑛=1
∑(−1)𝑛+𝑎+1
𝐹𝑛
𝑁
𝑛=1
= (−1)𝑎+1∑(−1)𝑛
𝐹𝑛
𝑁
𝑛=1
= (−1)𝑎+1𝔾𝑁(𝑎).
∎
ALTERNATING SUM
The alternating sum of Fibonacci numbers of negative indices of 1st order is,
𝕀𝑁(𝑎) = ∑(−1)𝑛
𝐹−𝑛−𝑎
𝑁
𝑛=1
.
We express this in terms of 𝔽𝑁(𝑎) .
𝕀𝑁(𝑎) = ∑(−1)𝑛
𝐹−𝑛−𝑎
𝑁
𝑛=1
= ∑(−1)𝑛
(−1)𝑛+𝑎+1𝐹𝑛=
𝑁
𝑛=1
∑(−1)𝑎+1
𝐹𝑛
𝑁
𝑛=1
= (−1)𝑎+1∑1
𝐹𝑛
𝑁
𝑛=1
= (−1)𝑎+1𝔽𝑁 .
∎
ORDER 2 We next consider the following 2nd order sums:
ℍ𝑁(0, 𝑎) = ∑1
𝐹−𝑛𝐹−𝑛−𝑎
𝑁
𝑛=1
,
𝕀𝑁(0, 𝑎) = ∑(−1)𝑛
𝐹−𝑛𝐹−𝑛−𝑎
𝑁
𝑛=1
,
ℍ𝑁(𝑎, 𝑏) = ∑1
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁
𝑛=1
,
𝕀 𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁
𝑛=1
.
We express the above sums in terms of 𝔽𝑁(0, 𝑎),𝔾𝑁(0, 𝑎), 𝔽𝑁(𝑎, 𝑏) and 𝔾𝑁(𝑎, 𝑏).
![Page 21: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/21.jpg)
Page | 21
NON-ALTERNATING SUM
We consider the following 2nd order non-alternating sums.
ℍ𝑁(0, 𝑎) = ∑1
𝐹−𝑛𝐹−𝑛−𝑎
𝑁
𝑛=1
𝑤ℎ𝑒𝑟𝑒 𝑎 > 0,
ℍ𝑁(𝑎, 𝑏) = ∑1
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁
𝑛=1
𝑤ℎ𝑒𝑟𝑒 0 < 𝑎 < 𝑏.
We express the above sums in terms of 𝔽𝑁(0, 𝑎) and 𝔽𝑁(𝑎, 𝑏) respectively.
First we consider the sum,
ℍ𝑁(𝑎) = ∑1
𝐹−𝑛𝐹−𝑛−𝑎
𝑁
𝑛=1
=∑1
(−1)2𝑛+𝑎+2𝐹𝑛=
𝑁
𝑛=1
∑(−1)𝑎
𝐹𝑛𝐹𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎∑1
𝐹𝑛𝐹𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎𝔽𝑁(0, 𝑎).
∎
We next consider,
ℍ𝑁(𝑎, 𝑏) = ∑1
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁
𝑛=1
= ∑1
(−1)2𝑛+𝑎+𝑏+2𝐹𝑛+𝑎𝐹𝑛+𝑏
𝑁
𝑛=1
= ∑(−1)𝑎+𝑏
𝐹𝑛+𝑎𝐹𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎+𝑏∑1
𝐹𝑛+𝑎𝐹𝑛+𝑏
𝑁
𝑛=1
= (−1)𝑎+𝑏𝔽𝑁(𝑎, 𝑏).
∎
ALTERNATING SUM
We consider the following 2nd order alternating sums.
𝕀𝑁(0, 𝑎) = ∑(−1)𝑛
𝐹−𝑛𝐹−𝑛−𝑎
𝑁
𝑛=1
𝑤ℎ𝑒𝑟𝑒 𝑎 > 0,
𝕀𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁
𝑛=1
𝑤ℎ𝑒𝑟𝑒 0 < 𝑎 < 𝑏.
![Page 22: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/22.jpg)
Page | 22
We express the above sums in terms of 𝔾𝑁(0, 𝑎) and 𝔾𝑁(𝑎, 𝑏).
First we consider the sum,
𝕀𝑁(𝑎) = ∑(−1)𝑛
𝐹−𝑛𝐹−𝑛−𝑎
𝑁
𝑛=1
=∑(−1)𝑛
(−1)2𝑛+𝑎+2𝐹𝑛=
𝑁
𝑛=1
∑(−1)𝑛+𝑎
𝐹𝑛𝐹𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎∑(−1)𝑛
𝐹𝑛𝐹𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎𝔾𝑁(0, 𝑎).
∎
Next we consider,
𝕀𝑁(𝑎, 𝑏) = ∑(−1)𝑛
𝐹−𝑛−𝑎𝐹−𝑛−𝑏
𝑁
𝑛=1
= ∑(−1)𝑛
(−1)2𝑛+𝑎+𝑏+2𝐹𝑛+𝑎𝐹𝑛+𝑏
𝑁
𝑛=1
= ∑(−1)𝑛+𝑎+𝑏
𝐹𝑛+𝑎𝐹𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎+𝑏∑(−1)𝑛
𝐹𝑛+𝑎𝐹𝑛+𝑏
𝑁
𝑛=1
= (−1)𝑎+𝑏𝔾𝑁(𝑎, 𝑏).
∎
SUM WITH INDICES IN A.P.
Let ℎ be a natural number. We convert the following sums in terms of 𝔽𝑁ℎ and 𝔾𝑁
ℎ .
ℍ𝑁ℎ =∑
1
𝐹−ℎ𝑛
𝑁
𝑛=1
, 𝕀𝑁ℎ = ∑
(−1)𝑛
𝐹−ℎ𝑛
𝑁
𝑛=1
.
ℍ𝑁ℎ = ∑
1
𝐹−ℎ𝑛
𝑁
𝑛=1
= ∑1
(−1)ℎ𝑛+1𝐹ℎ𝑛
𝑁
𝑛=1
= ∑(−1)ℎ𝑛+1
𝐹ℎ𝑛
𝑁
𝑛=1
= −∑((−1)ℎ)𝑛
𝐹ℎ𝑛
𝑁
𝑛=1
![Page 23: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/23.jpg)
Page | 23
=
{
−∑
(−1)𝑛
𝐹ℎ𝑛
𝑁
𝑛=1
if ℎ is odd,
−∑1
𝐹ℎ𝑛
𝑁
𝑛=1
if ℎ is even.
= {−𝔾𝑁
ℎ if ℎ is odd,
−𝔽𝑁ℎ if ℎ is even.
∎
𝕀𝑁ℎ = ∑
(−1)𝑛
𝐹−ℎ𝑛
𝑁
𝑛=1
= ∑(−1)𝑛
(−1)ℎ𝑛+1𝐹ℎ𝑛
𝑁
𝑛=1
= ∑(−1)ℎ𝑛+1+𝑛
𝐹ℎ𝑛
𝑁
𝑛=1
= −∑((−1)ℎ+1)𝑛
𝐹ℎ𝑛
𝑁
𝑛=1
=
{
−∑
1
𝐹ℎ𝑛
𝑁
𝑛=1
if ℎ is odd,
−∑(−1)𝑛
𝐹ℎ𝑛
𝑁
𝑛=1
if ℎ is even.
= {−𝔽𝑁
ℎ if ℎ is odd,
−𝔾𝑁ℎ if ℎ is even.
∎
NON-ALTERNATING SUM OF ORDER 1
We consider the problem of finding 1st order non-alternating sum of Fibonacci number with
negative indices, ℍ𝑁ℎ (𝑎).
ℍ𝑁ℎ (𝑎) = ∑
1
𝐹−ℎ𝑛−𝑎
𝑁
𝑛=1
where ℎ > 0 and ℎ|𝑎.
We write the above sum in terms of 𝔽𝑁(𝑎) and 𝐺𝑁(𝑎).
![Page 24: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/24.jpg)
Page | 24
ℍ𝑁ℎ (𝑎) = ∑
1
𝐹−ℎ𝑛−𝑎
𝑁
𝑛=1
=∑1
(−1)ℎ𝑛+𝑎+1𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
=∑(−1)ℎ𝑛+𝑎+1
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎+1∑(−1)ℎ𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎+1∑((−1)ℎ)𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎+1
{
∑
(−1)𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
if ℎ is odd,
∑1
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
if ℎ is even.
= {(−1)𝑎+1𝔾𝑁
ℎ (𝑎) if ℎ is odd,
(−1)𝑎+1𝔽𝑁ℎ (𝑎) if ℎ is even.
∎
ALTERNATING SUM OF ORDER 1
We consider the problem of finding 1st order non-alternating sum of Fibonacci number with
negative indices, 𝕀𝑁ℎ (𝑎).
𝕀𝑁ℎ (𝑎) = ∑
(−1)𝑛
𝐹−ℎ𝑛−𝑎
𝑁
𝑛=1
where ℎ > 0 and ℎ|𝑎.
We express the above sum in terms of 𝔽𝑁(𝑎) and 𝐺𝑁(𝑎).
𝕀𝑁ℎ (𝑎) = ∑
(−1)𝑛
𝐹−ℎ𝑛−𝑎
𝑁
𝑛=1
= ∑(−1)𝑛
(−1)ℎ𝑛+𝑎+1𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
= ∑(−1)ℎ𝑛+𝑎+1
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
![Page 25: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/25.jpg)
Page | 25
= (−1)𝑎+1∑(−1)ℎ𝑛+𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎+1∑((−1)(ℎ+1))
𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
= (−1)𝑎+1
{
∑
1
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
if ℎ is odd,
∑(−1)𝑛
𝐹ℎ𝑛+𝑎
𝑁
𝑛=1
if ℎ is even.
= {(−1)𝑎+1𝔽𝑁
ℎ (𝑎) if ℎ is odd,
(−1)𝑎+1𝔾𝑁ℎ (𝑎) if ℎ is even.
∎
![Page 26: SUM OF PRODUCT OF RECIPROCALS OF FIBONACCI NUMBERSA Thesis Submitted in the Partial Fulfillment of the Requirements of Degree for Integrated M.Sc. In ... Odisha for the partial fulfillment](https://reader035.vdocuments.us/reader035/viewer/2022071409/6101f74cb0e2ff33fb177f86/html5/thumbnails/26.jpg)
Page | 26
REFERENCES
[1] T. Koshy, Elementary Number Theory with Application, London: Academic Press, 2007.
[2] M. Krzywkowski, "New Proofs of Some Fibonacci Identities," International Mathematical Forum, vol. 5, no. 18, pp. 869 - 874, 2010.
[3] D. Kalman and R. Mena, "The Fibonacci Numbers-Exposed," Mathematics Magazine, vol. 76, no. 3, pp. 167-181, 2003.
[4] S. Rabinowitz, "Algorithmic Manipulation of Fibonacci Identities," Kluwer Academic Publishers, vol. 6, pp. 389-408, 1996.
[5] S. Rabinowitz, "Algorithmic Summation of Reciprocals of Products of Fibonacci Numbers," The Fibonacci Quarterly, vol. 37, pp. 122-127, 1999.
[6] I. J. Good, "A Symmetry Property of Alternating Sums of Products of Reciprocals," The Fibonacci Quarterly, vol. 32, no. 3, pp. 284-287, 1994.
[7] L. Carlitz, "Reduction Formulas for Fibonacci Summations," The Fibonacci Quaterly, vol. 9, no. 5, pp. 510-511, 1971.
[8] D.Burton, Elementary Number Thoery, New York: MacGraw Hill Higher Education, 2007.
[9] M. Jastrzebska and A. Grabowski, "Some Properties of Fibonacci Numbers," Formalized Mathematics, vol. 12, no. 3, pp. 307-312, 2004.
[10] A. T. Benjamin and J. J. Quinn, "Recounting Fibonacci and Lucas Identities," College Math, vol. 30, no. 5, pp. 167-181, 2003.