Regularities of the Fibonacci triangle based on the coefficients of power

transformation of a quadratic trinomial

Correlationbetween polynomialsPhibonacci, Pascal's triangle and binomial
coefficients were studied in[1-6](andreferencestherein).I will sing[6]described the connection
of Fibonacci numbers with the Pascal trianglewhichusuallyis constructed from the
n
factors of power transformations of Newton's binomial ( x+ y ) in the form shownin
Figure 10.1[7]:
n Expanded polynomial Rectangular form Pascal`s form of Symbolicform of triangle n
2n = ∑ C kn
of triangle triangle k =0
0 1 1 1 C00 20
1 1x+1y 11 11 0 1 21
C1 C1
2 1x2+2xy+1y2 121 1 21 0 1 2 22
C2 C 2 C2
3 1x3+ 3x2y + 3xy2+ 1y3 1331 1 3 31 0 1 2 3 23
C3 C3 C 3 C3
4 1x4+ 4x3and + 6x2Y24xy3+ 14641 1 4 6 41 C04 C14 C24 C34 C 44 24
1y4
5 1x5+5x4and + 15 10 1051 1 5 10 10 51 0 1 2 3 4 5 25
C 4 C 4 C 4 C 4 C5 C 5
… 10x3Y210x2Y3+5xy4+1y5 … … …
… …

Figure 10.1
Rectangular (or tabular)the shape of a triangle of numbers,it is possibleto
fileassymmetrical triangle.In a right triangle n The Fibonacci number is equal to the sum
of the numbers equal toalong the line, whereas in the symmetrical Pascal triangle, along
n ascending diagonal drawn through the line of the triangle with the number n−1 .In this
paper, investigatedpatternstriangle of numbers,built on coefficientspower
n
transformation х =α n х + β n square trinomial
х 2= px +q . (10.1)

{
which has the form:
n=0 : х 0 =0⋅х +1=α 0⋅х + β 0 ,
1
n=1: х =+ 1⋅х+ 0=α 1⋅х + β 1 ,
2 1
n=2 : х = p х +q=α 2 х+ β2 ,
n=3 : х 3 =( p2 + q) х + pq=α 3 х + β 3 ,
n=4 : х 4 =( p3 +2 pq ) х +( p 2 +q ) q=α 4 х + β 4 ,
n=5 : х 5=( p4 +3 p 2 q+ q 2 ) х+( p 3 +2 pq) q=α 5 х+ β5 ,
n=6 : х 6 =( p5 +4 p3 q+ pq 2 ) х+( p4 +3 p2 q+ q 2 ) q=α 6 х+ β6 ,
n=7 : х 7 =( p6 +5 p 4 q +6 p2 q 2 +q 3 ) х +( p5 +4 p 3 q+3 pq 2 ) q=α 6 х + β 6 ,
n=8 : х 8 =( p7 +6 p5 q+ 10 p3 q2 + 4 pq 3 ) х +( p 6 +5 p4 q+6 p2 q 2 + q3 ) q=α 6 х+ β6
. . .. .
(10.2)

1
IN (10.2),Pconsistencynumbers {α n } recurrent,therefore themmembers α n calculated by
formulas
α n+2= pα n+1 + qα n , n≥0 , (10.3)
supplementedinitial conditions
α 0 =0 , α 1 =1 . (10.4)
Members of sequences { β n } calculated by formulas
β n =qα n−1 , (10.5)
therefore the sequence { β n } also recurrent.
Let's construct from expressions for α n in (10.2) symbolic triangle (10.6a) and on

¿¿
its basis we will form a triangle of numbers(10.6b)for the case p=1,q=1 :

(10.6)
In transformations (10.2), the first two numbers α 0 and α 1 fixed, so in (10.6b) line
numbering is shifted by two units m=n−2 . Then the zero column in (10.6b), will be
formed by the initial (zero) sequence of units. In the triangle of numbers (10.6b), each
odd line starts with one and ends with one, while an even line starts with one and ends
m+2 n
=
with a number 2 2 .In symbolic form, the triangle of numbers (10.6b) will be

{
written down so:
Rows , n−2= m
m=0 С0
0
m=1 С0 1
1 С1
m=2 С0 1
2 С2 0
m=3 С0 3 С3
1
С23 0
0 1 2
m=4 С 4 С 41 С 4 0 0
m= 5 С0 5 С5
1
С 52 С 35 0 0
0 1 2 3
m=6 С 6 С6 С6 С 6 0 0 0
...
th th th th
Column , k : 0 1 2 3 ..
(10.7)

2
From the comparison (10.6b) and (10.7) it follows that within the first two columns of
the triangle (10.6b), the recurrent relationship between binomial coefficients has the
form
C1m=C1m−1 +C 0m−1 (10.8)
and in general it is equal to:
k k k −1
C m=Cm−1 +C m−2 . (10.9)
For values p=1,q=1 , triangles (10.6a) and (10.6b) coincide with each other.
Members of power transformations α n in (10.2) are known Fibonacci numbers Fn for the
model p=1 ,q=1 . Therefore, the triangle (10.7) is a right-angled Fibonacci triangle in
symbolic form. In contrast to Pascal's right triangle (Fig. 10.1), the descending
diagonals (10.7) are not filled with non-zero numbers. If inclassic straightPascal's
angular triangle, the sum of the members is equal to the corresponding Fibonacci
number Fm alongascending diagonals, then in a right-angled Fibonacci
triangle(10.6b)alongeach line;

{
m
α 0 =0 , F0 =0 ,
∑ C km=F m=α m , m=n−2 ,
α 1 =1 , F 1 =1 ,
k =0
(10.10)
whereas series of sequences of numbers (see Fig.10.2a)
single(1,1,1,1,…),natural(1,2,3,4,5,…),
triangular(1,3,6,10, 15,21,…),tetrahedral(1,4,10,20,35,…), (10.11)
and others(1,5,15,35,70,…);(1,6,21,56,126,…; 1,8,36,120,330,...
they coincide.
Along the diagonal of a right-angled Fibonacci triangle(10.6b)(this direction is
n
highlighted by a line onfig. 10.2a), the sum of numbers (1+1) expressed in binary
n
numbers 2 [2]:
20 =(1+1)0 , 21=(1+1)1 , 22 =(1+1)2 , 23 =(1+1 )3 , .. . ,2 n=(1+1)n , . ..
(10.12)
where n - Fibonacci number. In Pascal's right triangle (Fig. 10.1), the representation of
numbers in the form (10.12) is true along the lines.
The pattern (10.12) corresponds to the model p=1,q=1 in power transformations
(10.2). We substantiate it in the general case for arbitrary values p , q . To do this, from
(10.2) we write polynomials for α n in the form (10.13a), and choose in (10.13a) an
arbitrary descending diagonal (separated by a line) and perform algebraic
transformations of typeb):

3
{
α 2= р1
α 3 = р2 + q 1
α 4 = р3 + 2 p 1 q1 0
α 5 = р +3 p q + q2 0
4 2 1
(а )⇒ ¿ { p 3 + p2 q +3 pq 2 +q 3=( p 3 + p2 q)+2 p2 q+2 pq 2 + ¿ {+ pq 2 +q3 = p2 ( p+q)+q2 ( p+q)+2 pq( p+q )= ¿ ¿¿
α 6 =р 5 +4 p3 q 1 + 3 p1 q 2 0
6 4 1 2 2 3
α 7 = р +5 p q +6 p q + q
7 5 1 3 2 3
α 8 = р +6 р q +10 p q +4 pq

(10.13)
3 2 2 3
Yav follows from (10.13b),diagonal polynomial p + p q+3 pq +q is reduced to
3
a power binomial ( p +q ) . This result can be summarized as follows:
C0m pm +C1m+1 p m−1 q1 +C 2m+2 pm−2 q 2 +. ..+C km+k qm=( p+q )m . (10.14)
So if p=1,q=1 thenfrom (10.14)obsessed(10.12):

{
1+0+0+. ..+0=20 =1 ,
1+ 1+0+.. .+0=21 =2,
1+ 2+1+. . .+ 1=22 =4 ,
... (10.15)
As you know[2,8],hisla alongdiagonaldirections(10.14) are still positionedas
n
degrees 11 :
n=1: 11=111 , n=2: 121=112 , n=3 : 1331=113 ,
5 5
n=4 : 14641=11 , n=5 : 15101051=11 , .. . (10.16)
Regularity (10.16)comes true in the case p=1,q=1 , so we justify it for the general case
of arbitrary values p , q .To do this, consider the following element-by-element products

{
( p×q)m :
1
m=1: ( p×q ) = p q ,
p q
¿
2 p q
m=2: ( p×q ) =
−−−−−−−−−−−−−−−−−−−
p2 qp qp q 2 =p 2 2 qp q2
( p×q )m=
p 2 2 qp q 2
¿
m=3 : ( p×q )3 = p q
−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
p 3 2 qp2 pq 2 qp 2 2 q2 p q3 = p3 3 qp 2 3 q 2 p q3
. ..
(10.17)
So if p=1,q=1 thenfrom (10.17)obsessed(10.16):

4
 {
m=1 : (1×1)1 =11, ,
1 1
¿
m=2: (1×1)2 = 1 1, ,
−−−−−−−−
1 2 1=121
(1×1)m =
1 2 1
¿
3
m=3: (1×1) = 1 1 ,
−−−−−−−−−−
1 3 3 1=1331
. ..
(10.18)

WITHakonomirnosthose (10.12) - (10.18)reasonablenot for the first time.In

addition, in a right triangle of numbers (10.6b)elements of an arbitrary line n equal to
the sum of the previous two, calculated by the algorithm:

{
m=0 1 0 1 m=0 1 0 m=9 1
+
m=1 1 1 1 1 m=1 1 1 0 1 1 m=1 1 1
¿ +
1 2 m=2 1 2 1 2 0 m=2 1 2
¿
1 3 1 m=3 1 3 1
(10.19)
In (10.10), after summing the elements of two adjacent rows, the resulting row is
shifted to the right. Thus (10.19) is a recurrent rule for calculating the elements of an
arbitrary line in a Fibonacci triangle through the elements of two lines above it.
It is known[9]that whendeformationPascal's right triangle in symmetric, rows of
0
numbersFibonacciturn into ascending diagonals,in other words, return to 45
.Regularities of deformation of the Fibonacci triangle, shown in
0
Fig.10.2.Tutindicatorwe deform(turn on 45 ) are selecteddirectionthat (10.10)-
0
(10.12).After the firstbut → baboutrubbing on 45

k 0 1 2 3 4 5
α2 1
α3 1 1

α4 1 2 21
α5 1 3 1

α6 1 4 3 22

α7 1 5 6 1

α8 1 6 10 4 23

α9 1 7 15 10 1

but
5
 k 6 5 4 3 2 1 0
α2 1

α3 1 1

α4 1 2

α5 1 3 1

α6 1 4 3

α7 1 5 6 1

α8 1 6 10 4
24 23 22 21

b
k α8 α7 α6 α5 α4 α5 α4 α3 α2
0 1 1 1 1 1 1 1 1 1
1 8 7 6 5 4 3 2 1
2 28 21 15 10 6 3 1
3 56 35 20 10 4 1
4 70 35 15 5 1
5 21 6 1
26 25 24 23 22 21 20
c
k α9 α8 α7 α6 α5 α4 α3 α2
0 1 1 1 1 1 1 1 1
1 7 6 5 4 3 2 1
2 15 10 6 3 1 21
3 10 4 1 22
4 1 23
5
d
k α9 α8 α7 α6 α5 α4 α3 α2
6 7 1
5 15 6 1
4 10 10 5 1 25
3 1 4 6 4 1 24
2 1 3 3 1 23
1 1 2 1 22
0 1 1
f
5 4 3 2 1 0 k
1 10 15 7 1 α9
2 4 10 6 1 α8
3

1 6 5 1 α7
22 3 4 1 α6
1 3 1 α5
21 2 1 α4
1 1 α3
1 α2
g
Figure 10.2
6
 n
direction of binary numbers 2 , the lines are shiftedto the left by one digit relative to
each other (Fig.10.2b). After the secondb → with rotation, the columns are aligned on
the upper level (Fig.10.2c). At the stage of returnfrom → d, the lines are aligned on the
right edge (Fig.10.2d), and in the fourth staged → fcolumns in the direction from left to
right are shifted by one digit down(Figure 10.2f) and completes the stage of
deformation by forming a triangle (Fig.10.2g), mirror to the original in
Fig.10.2a.So,three selected directions indicators of deformation of the Fibonacci
triangle, forming a right triangle,the change of which also illustrates withminand the
triangleFibonacci in the process of itdeformation. The same is truefor a triangle of
numbers,constructed from factors in expressions for coefficients β n power
transformation (10.2).
Triangle of numbers (10.6b) in the recurrent equation (10.3), in the plane of
rectangular Cartesian coordinates 0 pq corresponds to a point with coordinates p=1, q=1 .
However, there are many points with coordinates р , q on the parabola р=√ q , for which

¿¿
the above-described regularities of the Fibonacci triangle are preserved:

(10.20)
INother points р≠1,q≠1 ,for example forphase direction р=q=s

¿¿¿
[9],intriangleinFibonacci

¿ (10.21)

7
the sum of numbers along a seriesalsois equal to the corresponding number Fn , a along
the diagonal directions parallel to the hypotenuse of the triangle(10.21),in accordance
with rule (10.12) we have:
( 3+3 )0 , ( 3+3 )1 , ( 3+3 )2 , ( 3+3 )3 , . .. ⇒ ( s+s )0 , ( s+s )1 , ( s+s )2 , ( s+s )3 ,. . . (10.22)
For the Fibonacci triangle (10.21b), rule (10.19) is implemented similarly with the
difference that the summation result must be multiplied by s :

{
m=1 9 3 9 3 m=2 9 3
+
m=2 27 18 27 18 m=2 27 18
=
27 27 3 m=3 81 81 9
(10.23)
if р=q . In the case of р≠q rule (10.23) calculation of line elements in a Fibonacci
triangle is valid taking into account the known recurrent relation
Fn+2 = pF n+1 +qF n . (10.24)

{
Let's show it on a concrete example:
m Fn+2 =2 F n+1 +3 F n
0 2 2
1 4 3 7
p=2 2 8 12 0 20
: 3 16 36 9 0 61 ⇒
q=3
4 32 96 54 0 0 182
5 64 240 216 27 0 0 547
6 128 576 720 216 0 0 0 1640
.. .

{
m=3 16 36 9 16⋅3⋅ 36⋅3 9⋅3
+
⇒ m=4 32 96 54 32⋅2 96⋅2 54⋅2
=
64 240 216 27 m=5 64 240 216 27 (10.25)
If р≠q , then in accordance with (10.12), the sum of binomial coefficients forms a
number:
( 2+3 )0 , ( 2+3 )1 , ( 2+3 )2 , ( 2+3 )3 ,. .. ⇒ ( p+ q )0 , ( p+q )1 , ( p+ q )2 , ( p+q )3 ,. . . (10.26)
In accordance with (10.13), in the case р=q the representation of numbers in the form
(10.14):

8
 {
Fibonacci 2−triangle
αn
α2 3
α 3 9 3 →33=3⋅( 11)=3 1⋅(11 )1
α 4 27 18
p=3 , q=3 : α5 81 9 →9189=3 2⋅(121 )=32⋅( 11 )1
α6 81
α7 27 →27818127=33⋅(1331 )=33⋅( 11 )3

.. .
(10.27)
and in a more general case р≠q , the transformation (10.27) has the form of element-by-
element multiplication

{
Fibonacci 2−triangle

{
αn
α2 2 23
α 3 4 3 →23 ¿
α 4 8 12 23
¿ 1
p=2 , q=3 : α 5 36 9 →4129=23×23= =( 23 )
6 9
α6 54 4 6
α7 27 −−−−−
4 12 9
...
(10.28)

{
or

αn Fibonacci 2−triangle
α2 2

{
α3 4 3
α 4 8 12 4 12 9
p=2 , q=3 : α 5 36 9 ¿
23
α6 54
¿ =( 23)3
α7 27 → 36 54 27=23×23×23= 12 36 27
8 24 18
. .. −−−−−−−−
8 36 54 27
(10.29)

The above regularities are true for generalized Fibonacci p-triangles[2,4]. Indeed,
inFibonacci3-trianglealso

n 0 1 2 3 4 5 6 7 8 9 10 11 k
9
0 1
1 1
2 1
3 1 1
4 1 2
5 1 3
6 1 4 1
7 1 5 3
8 1 6 6
9 1 7 10 1
10 1 8 15 4

Fig.10.3. The Fibonacci 3-trianle

existdirectionand sequences of numbersand parallel to them(highlighted onFigure

10.3),for whichregularities (10.14) and (10.16) come true. Note ifFibonacci2-
trianglestructured binary, ie it can be conditionally brokenhorizontal linesin the area of
two lines of equal length, thenFibonacci3-trianglestructured trinarly, ie similar areas
form three rows of equal length. .

10