International Journal of Trend in Scientific Research and Development (IJTSRD)

Volume 5 Issue 5, July-August

August 2021 Available Online: www.ijtsrd.com e-ISSN:
e 2456 – 6470

Generalization of Fibonacci Numbers with

Binomial Coefficients and
nd Figurate Numbers
Arka Mehatari
Student, St. Michael’s
Micha School, West Bengal, India

ABSTRACT How to cite this paper: Arka Mehatari

Fibonacci Sequence has formed the groundwork of "Generalization of Fibonacci Numbers
Mathematicians for research in Number Theory. Fibonacci has a with Binomial Coefficients and
profound influence all around us. There are many interesting Figurate Numbers" Published in
identities involving Fibonacci. With the invention of Binet’s International
Journal of Trend in
Formula (which is the most fundamental formula for finding nth
Scientific Research
Fibonacci), further search for generalisation of Fibonacci
Fibon sequence and Development
has almost came to an end but it is interesting to know that (ijtsrd), ISSN:
Fibonacci numbers can be expressed by Binomial Coefficients. 2456-6470,
6470,
Thus, I tried to convey the process of generalisation of Fibonacci IJTSRD46301
Volume-55 | Issue-5,
Issue
using Binomial coefficients. August 2021,
pp.2330-2338,
2338, URL:
KEYWORDS: Introduction and Application of Fibonacci, www.ijtsrd.com/papers/ijtsrd46301.pdf
Fibonacci Numbers from Pascal’s Triangle, Fibonacci Numbers
using Binomial Coefficients, Fibonacci Numbers from Figurate Copyright © 2021 by author (s) and
Numbers, Some Interesting Sums Involving Fibonacci International Journal of Trend in
Scientific Research and Development
Journal. This is an
Open Access article
distributed under
the terms of the Creative Commons
Attribution License (CC BY 4.0)
(http://creativecommons.org/licenses/by/4.0)

I. INTRODUCTION
Among the greatest Mathematicians of the Middle Fibonacci gives answer to all these problems.
Ages Leonardo of Pisa is considered to be one of It also plays a very important part in Infinite
the greatest Mathematician. He is mainly known for
Continued Fractions and it’s very interesting to
his work on Fibonacci.. Today, most of us are know that Fibonacci can be also used to generate
acquainted with the Fibonacci Sequence. Pythagorean Triples, and that’s too Primitive
The Fibonacci Sequence follows as Pythagorean Triples.
1,1,2,3,5,8,13,21…
For generating Pythagorean Triples take any four
This sequence has a profound influence around us consecutive Fibonacci Numbers from the sequence.
ranging from the spirals of sunflower, cones of pine
Let’s suppose we choose 1,2,3,5.
tree and breeding of rabbits.
1. At first double the product of the mean
Fibonacci Sequence has a wide application in numbers.
(Here, 2 2 3 12;; 12 is our first member of the
Probability, Combinatorics, Continued Fractions,
Solving Pell’s Equation etc.
triples.)
Fibonacci gives answer to the problems like,
5 1 5;; This 5 is our second element of the
2. Next multiply the extreme numbers.(Here,
1. Finding the probability of colouring a n-storey
n
house with the precondition that no two
triples.)
adjacent storey has the same colour.

form our last triple.(Here, 2 3 4 9

2. Let’s suppose you have to calculate the number 3. At last, sum of the squares of the mean numbers

13; This 13 is finally

of ways inn which you have to pay multiples of
Rs.25 using only Rs.25 and Rs.50. lly our last triple.)

@ IJTSRD | Unique Paper ID – IJTSRD46301

IJTSRD | Volume – 5 | Issue – 5 | Jul-Aug
Aug 2021 Page 2330
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470
Finally, our Pythagorean Triple is (12,5,13) Let’s check how it forms.

12 5 144 25 169 13
We can check our answer;

This can be generalised as following;

Fn denotes the nth Fibonacci element. Our four
Fibonacci Elements will be Fn, Fn+1, Fn+2, Fn+3.
(a,b,c) forms our ordered Pythagorean Triples.
a, b, c 2F 2F ,F F ,F
F
The general term for Fibonacci can be concluded

as,
(i.e., each term is formed by All the terms at the ends are 1 and thus following
summing previous terms). the Coefficients of Binomial Expansions, the first

0
II. PASCAL’S TRIANGLE and the last terms are given a as and
Pascal Triangle was discovered by French respectively where n denotes the row numbers. The
Mathematician Blaise Pascal. The Pascal’s Triangle middle elements are formed by following the t
is a triangle formed by the coefficients of the pascal’s rule.
binomial expansion. III. FIBONACCI NUMBERS FROM
The triangle looks as follows. PASCAL’S TRIANGLE
It is interesting to know that Fibonacci Numbers
can also be derived from the pascal’s triangle. This
was first observed by British Mathematician Ron
Knott. Later this was studied by French
Mathematician
tician Francois Edouard Anatole Lucas.
The diagonals of a Pascal’s Triangle add up to the
nth Fibonacci Number. Let’s check how it comes.
The diagonals of a Pascal Triangle can be added up
in this way to get the Fibonacci Numbers.

Consider that 0 is placed at the sides of the pascal’s

triangle. The first rule is that the numbers at the two
ends will be formed by summing the top two terms.
All the numbers at the end are 1.The middle
elements of Pascal’s Triangle is actually formed by
the binomial coefficients following the Pascal’s
Rule.

0
The first element of Pascal’s Triangle is 1

0
represented by Binomial Coefficient as .
0
0
So, the first element is . Summing up the diagonals
diagona in this way can give us
the Fibonacci Numbers from Pascal’s Triangle.
The next terms of the Pascal’s Triangle are formed
by summing the top binomial coefficients. IV. REPRESENTATION OF FIBONACCI
1
0
NUMBERS USING BINOMIAL
1 1
COEFFICIENTS.
Fibonacci Numbers can be derived from summing
the diagonals of Pascal’s Triangle which in turn is
actually formed by Binomial
inomial Coefficients.

@ IJTSRD | Unique Paper ID – IJTSRD46301

IJTSRD | Volume – 5 | Issue – 5 | Jul-Aug
Aug 2021 Page 2331
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

∈ ((clear that
This paves our path that in some way Fibonacci ALGORITHM - I
Numbers can be generalised using Binomial For any Fibonacci Number and
( ⊂ ℕ)where
Coefficients.

( *2' − 1 | ' ∈ ℤ; 2' − 1 > 0/

By the formation of Pascal Triangle using Binomial
Coefficients, let relate the Fibonacci Numbers in

0to
similar way. The lower term of the coefficients run from
The Fibonacci terms can be represented using the .So as to meet our precondition

the binomial coefficients must be − 1, the upper

Binomial Coefficients in the following way. that the sum of upper term and the lower term of

− 1 − to
Let F(n) denote the Fibonacci Number at nth term.
0
1 1
term must be assigned a value of

0 − 1.
make the sum of the upper and lower terms as

1
2 1 ∈
0
(where ( *2' − 1 | ' ∈ ℤ; 2' − 1 > 0/.
Therefore, for any Fibonacci Number and
2
1
3 2
0
1
upper term is − 1 − and the lower term runs
The is defined as the sum of coefficients whose
3
2
4 3 0to
0
1
4
3 2
from .

5 5
0
1 2
In a more generalised way this can be written as,

4
5 3
6 8 − −1
1
0 2 0 ∀ ∈ ( ⋯ 1
6 5 4 3
7 13 234
0 1 2 3
7 6 5 4
8 21
ALGORITHM - II

0 1 2 3 which ∉ (.
Our next aim is to generalise the formula for in

The sequence continues in this way.

of n which is of the form 2' − 1.
It is clear that the set P includes all the possibilities
V. GENERALISATION OF FIBONACCI
NUMBERS USING BINOMIAL
the form 2'.
Next, we have to find a formula for n which is of
COEFFICIENTS

∈ 7(clear that
For a Fibonacci Number , the representation
using summation of Binomial Coefficients follows For any Fibonacci Number and
a specific pattern. This pattern can be generalised 7 ⊂ ℕ) where
7 *2' | ' ∈ ℤ; 2' > 0/
as,
−1 −2 −3 −4
0 1 2 3 0
−5 −6
⋯
The lower term of the coefficients run from

4 5
to . So as to meet our precondition that the

binomial coefficients must be − 1, the upper term

sum of upper term and the lower term of the
By a slight observation of the above pattern one
− 1 − to make
terms of the Binomial Coefficients is always −
can deduce that the sum of the upper and lower
the sum of the upper and lower terms as − 1.
must be assigned a value of
1 for the Fibonacci Number.
Therefore, for any Fibonacci Number and ∈
7where7 *2' | ' ∈ ℤ; 2' ≥ 0/.The
Now, we have to generalise this sum in a closed
is
form.
is − 1 − and the lower term runs from
defined as the sum of coefficients whose upper term

0to
We have to derive a formula for finding the nth

algorithm,every n ∈ ℕ is either of the form 2'

term of Fibonacci( ). According to the division .

or 2' 1. [As when divisible by 2] In a more generalised way this can be written as,
Considering the case of 2' 1. Adding and
subtracting 1 to it we get 2' 1.

@ IJTSRD | Unique Paper ID – IJTSRD46301 | Volume – 5 | Issue – 5 | Jul-Aug 2021 Page 2332
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

− −1
We have verified our base step.
0 ∀ ∈ 7 ⋯ 2 INDUCTION HYPOTHESIS:
234 We have,
Through the equations (1) and (2), all the
− −1
@ 0 ∀ ∈ (
possibilities of n are covered.

234
Our final conjecture is given as follows,

< ? − −2
∴@ −1 0 ∀ ∈ (
:0 − −1
∀ ∈ ( : 234
:234 :

; >
We need to show,

: : −
:0 − −1 @ 1 0 ∀ ∈ (
∀ ∈ 7 :
9 234 = 234

@ 1 @ @ −1
Let this be considered as a Fi-binomial conjecture. Satisfying the condition,
THEOREM – I :

−
− −1 ∴@ 1 0
0 ∀ ∈ (
234
234

−0 −
0
PROOF:
0
23
The above theorem can easily be proved by
Mathematical Induction.

− −1 − −1
1 0B C
Let define it as a function.

−1
− −1 23
@ 0 ∀ ∈ (
−1 − −1 − −1
234
0 0
We have our set P as, 0 −1
23 23
( *2' − 1 | ' ∈ ℤ; 2' − 1 > 0/

− −1 − −2
0 0
In, set P it is clear that the set elements differ by 2.

234 234
By the definition of Fibonacci we know;
@ 1 @ @ −1
− −1 − −2
0 0
BASE PROOF:
4
1− −1 234 234
@ 1 0
@ @ −1
234
1−0−1 0
1 satisfying the condition, @ 1 @ @ −
0 0
We have proved it by Mathematical Induction

1 .

3− −1
THEOREM – II:
@ 3 0
− −1
234 0 ∀ ∈ 7
2 1
1 1 2
234
0 1

@ IJTSRD | Unique Paper ID – IJTSRD46301 | Volume – 5 | Issue – 5 | Jul-Aug 2021 Page 2333
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

− −1 − −1
PROOF:
1 0B C
−1
The above theorem can easily be proved by

23
Mathematical Induction.
Let define it as a function,

−1 − −1 − −1
− −1 0 0
@ 0 ∀ ∈ 7 0 −1
23 23
234

− −1 − −2
7 *2' | ' ∈ ℤ; 2' > 0/ 0 0
We have our set Q as,

234 234
D
In set Q, it is clear that the elements differ by 2.

− −1 − −2
@ 1 @ @ −1 0 0
By the definition of Fibonacci, we know;

234 234
4 @ @ −1
BASE PROOF:
2− −1
@ 2 0
234 satisfying the condition, @ 1 @ @ −
We have proved it by Mathematical Induction

1 1 .
1
0

4− −1
ALGORITHM - III

@ 4 0
This Fi-binomial Conjecture can also be formulated
based on the index.
234
3 2
1 2 3 form 2' and 2' − 1 respectively.
It is known every even and odd number is in the
0 1
We have verified our base step. Now, ' ∈ ℕ;

form 2' − 1.
INDUCTION HYPOTHESIS: Considering a Fibonacci number which is of the

We have,
It can be calculated by Index as,

− −1 2' − 2 −
@ 0 ∀ ∈ 7 E 0 ∀ ' ∈ ℕ ⋯ 3
234 234
D

− −2
ALGORITHM – IV
∴@ −1 0 ∀ ∈ 7 form 2' − 1.
Considering a Fibonacci number which is of the

234
It can be calculated by Index as,
We need to show,
2' − 1 −
0 ∀ ' ∈ ℕ ⋯ 4
−
E
∴@ 1 0 ∀ ∈ 7 234
234

Satisfying the condition, @ 1 @ @ −

Again, Mathematical Induction is enough to prove

1 .
these formulas.
Up till, now we generalised Fibonacci Number

−
using Binomial Coefficients using two different

∴@ 1 0
Formulas.

234
These two formulae can be summarised into one.
We contend our conjecture,
−0 −
0
0
23

@ IJTSRD | Unique Paper ID – IJTSRD46301 | Volume – 5 | Issue – 5 | Jul-Aug 2021 Page 2334
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

< ?
− −1
BASE PROOF:
:0 ∀ ∈ ( :
Taking n=1;
:234 : 4
1− −1
@ 1 0
; > 234
: : 0
:0 − −1 1
∀ ∈ 7 : 0
9 234 =
For n=2;
4
2− −1
Where P and Q are given as,
( *2' − 1 | ' ∈ ℤ; 2' − 1 > 0/ @ 2 0
7 *2' | ' ∈ ℤ; 2' > 0/ 234
1
1
0
ALGORITHM - V
In both the cases the Summation term is same, only
the upper limit of the summation differs in the We have verified our base step.
cases.
When n is of the form 2' − 1, the upper limit of the
INDUCTION HYPOTHESIS:

summation is − .
We have,
F G
When n is of the form 2', the upper limit of the − −2
@ −1 0
summation is − 1.
234

F G
. − −1
Actually, for both the cases the upper limit of the

@ 0
summation is the greatest integer function of
234

F G.
This can be represented by the floor function as,
We need to show;
F G
−
@ 1 0
Now, we can summarise both the formulas into one.

234
We have,
F G F G
− −1 −
0 ∀ ∈ ℕ ⋯ 5 ∴@ 1 0
234 234

F G
−0 −
0
0
Using Eq. (5), we can find for any value of nth
23
term.

Now , we have the upper limit as F G − 1.

Based on the requirements, one can use any of the

For a value of x, H'I 1.

formulas for finding the Fibonacci Number.
The above equation can easily be proved by
Mathematical Induction. ∴ 1 ' < 2 or ' ∈ [1,2 . Taking the mean value
THEOREM – III: of'we have' .
F G
− −1 F G
0 −
234
∴0
23

F G
PROOF:

−0 −
0
We can prove this by Mathematical Induction.

0
By the definition of Fibonacci, we know
@ 1 @ @ −1 23

@ IJTSRD | Unique Paper ID – IJTSRD46301 | Volume – 5 | Issue – 5 | Jul-Aug 2021 Page 2335
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470
F G F G
−0 −
That can also be used to represent Fibonacci using
0
0
Figurate Numbers.

23
Natural Numbers (linear numbers) can be
F G
represented by Binomial Coefficients as,

− ∀ ∈ ℕ
1 0 1
23 We know that Triangular Numbers which appear on
F G
the third diagonal of Pascal’s triangle are of the
n−k−1 n−k−1
1 0 B C
form,
k k−1 1
N3
O 0 ∀ ∈ ℕ
F G F G
1 2
23
n−k−1 n−k−1
1 0 0
k k−1
Similarly, other 3-D figurate numbers such as
N3 23
Tetrahedral(appear in the fourth diagonal of
F G
Pascal’s Triangle) and Pentatope Numbers(known

−2 − −1
0
as 4-simplex appear in the fifth diagonal of Pascal’s

0
Triangle) number are respectively of the form,
Q
2
23
F G OP 00 ∀ ∈ ℕ
1 3
− −2
0 Q3 23
U Q
234
3
(RST 000 ∀ ∈ ℕ
F G 1 4
−2 − −1
U3 Q3 23
0
0
23
Where Ten and Ptopn represents the nth Tetrahedral
F G F G
and Pentatope Number respectively.

− −2
0
Similarly, for a r-simplex number which appear on
the (r+1)th diagonal of Pascal’s Triangle is given as,
234 U
Q
_−1
F G F G
(V 0 0⋯⋯0
− −1 − −2 1 _
0 0 XYYYYYZYYYYY[
Q3 W3 23
V \WQ]^
234 234

F G F G
These Numbers can also be represented as products
− −1 − −2
0 0
in the following ways.
4
1
234 234 ∴ a R
1 1!
@ @ −1 \34

1
∴ O 0 a R
By Mathematical Induction we have proved the
1 2!
value of
F G 23 \34
− Q
@ 1 0 1
∴ OP 00 a R
234 1 3!
Q3 23 \34
1 @ @ −1 U
Q V
1
Satisfying,@

∴ (V 0 0⋯⋯0 a R
1 _!
VI. REPRESENTATION OF FIBONACCI
NUMBERS USING FIGURATE XYYYYYZYYYYY[
Q3 W3 23 \34
V \WQ]^
NUMBERS
∀ _ > 0, ∈ℕ
Using the concept of representation of Fibonacci as
a sum of Binomial coefficients(Explained in section
III.).

@ IJTSRD | Unique Paper ID – IJTSRD46301 | Volume – 5 | Issue – 5 | Jul-Aug 2021 Page 2336
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

< 1
\ ?
As the r-simplex number appears in the (r+1)th row
:1 0d a − 2R e f ∀ ∈ ( :
R!
of the Pascal’s Triangle and by recalling the
: :
representation of Fibonacci Numbers from Pascal’s
Triangle (From section. III) it is possible to rewrite \3 W34
the Fibonacci Sequence using Figurate Numbers. ; >
1 1 : 1
\ :
:1 0d a − 2R e f ∀ ∈ 7 :
2 1 9 R! =
\3 W34
3 2 1 ( 1
4 3 1 ( 2
These two formulas can again be summarised into
one.
5 5 1 ( 3 ( 1 In both the cases the Summation term is same, only
6 8 1 ( 4 ( 2
the upper limit of the summation differs in the

7 13 1 ( 5 ( 3 ( 1
cases.
When n is of the form 2' − 1, the upper limit of the
8 21 1 ( 6 ( 4 ( 2 summation is − .
When n is of the form 2', the upper limit of the
By a slight observation one can notice that the
summation is − 1.
general sequence follows as,
1 ( −2 ( −4 ( −6
(D −8 (b − 10 (c − 12 . ..
.
Actually, for both the cases the upper limit of the
summation is the greatest integer function of
Replacing the Figurate Numbers s products as

F G.
described above, we get This can be represented by the floor function as,
4
1 1
1 a −2 R a −4 R
1! 2!
\34 \34
Now, we can summarise both the formulas into one.
2 F G
1 1
\
1
a −6 R ⋯⋯ a −2 R ∴ 1 0 d a − 2R e f ∀ ∈ ℕ
3! ! R!
\34 \34 \3 W34
This can be represented in a closed form as, This is a summarised but a much more complicated
2 \
1
equation and also not very flexible.
1 0d a − 2R e f ∀
R!
But from this formula it is clear that Fibonacci
\3 W34
∈ ℕ ⋯ 6
Sequence can also be represented as the sum of
products.
Recalling back our sets P and Q,
( *2' − 1 | ' ∈ ℤ; 2' − 1 > 0/
VII. CONCLUSION
We have found a lot of fibonomial identities up to

7 *2' | ' ∈ ℤ; 2' > 0/

now, which can be used to find the nth term of a

∈ (, the value of k will run from 1

Fibonacci element. Along with the theorems the
For any proofs of the theorem are also provided. We have
to proved the theorems by the use of Mathematical
−1
.
Induction.

2 Our Fibonomial Identity Conjecture can be

∈ 7, the value of k will run from
summarised as follows.
1 to Consider sets P ( ⊂ ℕ and Q 7 ⊂ ℕ) such that,
Again for any

−2 ( *2' − 1 | ' ∈ ℤ; 2' − 1 > 0/

.
2 7 *2' | ' ∈ ℤ; 2' > 0/
An integer n( ∈ ℕ), is either of the form 2' or
2' − 1 (as when divisible by 2). So, either ∈ (
or ∈ 7.

@ IJTSRD | Unique Paper ID – IJTSRD46301 | Volume – 5 | Issue – 5 | Jul-Aug 2021 Page 2337
 International Journal of Trend in Scientific Research and Development @ www.ijtsrd.com eISSN: 2456-6470

< ?
− −1
[2] Fabulous Fibonacci Numbers by Alfred S.
:0 ∀ ∈ ( :
Posamenties and Ingmar
:234 :
Lehmann(Prometheus Books Publication)

; >
[3] A Combinatorial Approach to Fibonomial

: :
Identities by Prof. Arthur Benjamin

:0 − −1
∀ ∈ 7 :
[4] Fibonomial Identities by Prof. Arthur
9 234 =
Benjamin

Another important identity using which we can [5] Recounting Binomial Fibonacci Identities by
found the nthterm Fibonacci for any value of n. Prof. Arthur Benjamin

F G
[6] Wolfram MathWorld website Fibonacci Page,
− −1
0 ∀ ∈ ℕ
https://mathworld.wolfram.com/FibonacciNu
mber.html
234 [7] Wolfram MathWorld website Figurate
We have also shown the representation of Numbers Page,
Fibonacci sequence using Figurate Numbers which https://mathworld.wolfram.com/FigurateNum
again can be represented by Summation of ber.html#:~:text=A%20figurate%20number%
products. The formula is much more complicated 2C%20also%20(but,arrangement%20of%20e
and not so flexible but it will work correctly and qually%20spaced%20points.
yield Fibonacci sequence correctly. [8] Figurate Numbers Wikipedia Page,
The summarised formula is given below. https://en.wikipedia.org/wiki/Figurate_numbe
F G
r
\
1
1 0 d a − 2R e f ∀ ∈ ℕ
R!
[9] Fibonacci Numbers Wikipedia Page,
https://en.wikipedia.org/wiki/Fibonacci_num
\3 W34 ber
[10] Generalisation of Fibonacci Numbers
VIII. REFERENCES Wikipedia Page,
[1] Elementary Number Theory by David. M https://en.wikipedia.org/wiki/Generalizations
Burton (McGraw Hill Publication). _of_Fibonacci_numbers

@ IJTSRD | Unique Paper ID – IJTSRD46301 | Volume – 5 | Issue – 5 | Jul-Aug 2021 Page 2338