Non Degeneration of Fibonacci Series, Pascal’s Elements and Hex Series ()
1. Introduction
The Fibonacci sequence is named after Leonardo of Pisa (c. 1170-c. 1250), popularly known as Fibonacci. He wrote a number of books such as Liber Abaci (The Book of Calculating) in 1202, Practica Geometriae (Practical Geometry) in 1220, Flos in 1225, and Liber Quadratorum (The Book of Squares) in 1225. Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding numbers. First few numbers in the series are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 … In India, Fibonacci sequence appeared in Sanskrit prosody (a system of versification). In the Sanskrit oral tradition, there was much emphasis on how long (L) syllables that are 2 units of duration mix with the short (S) syllables that are 1 unit of duration. Counting the different patterns of L and S within a given fixed length results in the Fibonacci numbers—the number of patterns that are m short syllables-long is the Fibonacci number Fm + 1. According to Susantha Goonatilake of Royal Asiatic Society Sri Lanka, the development of the Fibonacci sequence “is attributed in part to Pingala (200 BC), later being associated with Virahanka (c. AD 700), Gopala (c. AD 1135), and Hemchandra (c.AD 1150)”. To find Fn for a general positive integer n, we hope that we can see a pattern in the sequence of numbers already found. A sharp eye can now detect that any number in the sequence is always the sum of the two numbers preceding it. That is,
, for
.
Fibonacci series is helix like identity. It converges to golden ratio, we can show its existence in spiral shells but its elements never construct volumetric object. Fibonacci series elements construct Area only. Pascal triangle elements (Binomial series elements) construct area, volume and volumetric objects but whatever be it remains its identity which means, if we constructed a matrix with Pascal triangle elements, which would be a square matrix, its kth power or its inverse might have the same identity of Pascal triangle elements, hex series having different numbers, but all numbers will be derived by triangular series numbers.
The Fibonacci Numbers are also applied in Pascal’s Triangle. Entry is sum of the two numbers either side of it, but in the row above. Diagonal sums in Pascal’s Triangle are the Fibonacci numbers. We are getting some ideas from ( [1] Jeffrey R. Chasnov (2016-19) - Fibonacci Numbers and the Golden ratio - Lecture Notes for Course - The Hong Kong University of Science and Technology, Department of Mathematics, Clear Water Bay, Kowloon - Hong Kong). We know Fibonacci Numbers and the Golden ratio ( [2] Tom Davis, Exploring Pascal’s Triangle- tomrdavis@earthlink.net http://www.geometer.org/mathcircles, January 1, 2010; Relation between Pascal’s triangle and Fibonacci’s numbers; [3] Balasubramani Prema Rangasamy - Some extensions on numbers - Advances in Pure Mathematics, 2019, 9, 944-958. Difference table and [4] https://en.wikipedia.org/w/index.php?title=Golden_ratio&oldid=83746951"8) We know more about Fibonacci’s elements, Pascal’s elements, Hex numbers and Golden ratio. The Golden Section represented by the Greek letter Phi (φ) = 1.6180339887.
In this paper, I give the general formula for generating various types of Fibonacci series and its non-degeneration, how Pascal elements maintain its identities and which shapes formed by hex numbers by difference and matrices.
2. Row Matrix Building for Fibonacci’s Elements
Difference method
is a m × 2 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are difference of two consecutive odd rows numbers.
is a m × 3 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are difference of two consecutive odd rows numbers.
is a m × 4 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are difference of two consecutive odd rows numbers.
is a m × 5 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are difference of two consecutive odd rows numbers.
We can generate mth series by
(1)
where
and m is an mth Fibonacci’s series. (2)
where
an nth element of a mth Fibonacci series,
is nth element of a 1st Fibonacci series and
is m + nth element of a 1st Fibonacci series.
1st series elements are known as Fibonacci numbers.
4th series elements are known as Lucas numbers.
Axiom 1: All the above series are converges to Golden ratio.
3. Addition Method
is a m × 2 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are addition of two consecutive odd rows numbers.
is a m × 3 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are addition of two consecutive odd rows numbers.
is a m × 4 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are addition of two consecutive odd rows numbers.
is a m × 5 matrix.
In which odd rows numbers are Fibonacci series numbers and even rows numbers are addition of two consecutive odd rows numbers.
We can generate kth series by
(3)
and
(4)
where
an nth element of a kth Fibonacci series,
is nth element of a 1st Fibonacci series and
is k + 1th element of a 1st Fibonacci series.
1st series elements are known as Fibonacci numbers.
2nd series elements are known as Lucas numbers.
3rd series elements are known as doubled Fibonacci numbers.
4th series elements are known as tripled Fibonacci numbers.
4. Difference between All Series Diagonal Elements
(6)
and
(7)
where
is nth element of a sth different series,
is nth element of a s + 1th Fibonacci series and
is n + 1th element of a sth Fibonacci series.
From above those diagonal differences remains the extinct of Fibonacci’s elements.
5. Difference Chart of Above Series
From the above we chart,
Diff tth series:
(9)
where
(10)
and
(11)
where
an nth element of a tth different Fibonacci series,
is nth element of a 1st Fibonacci series and
is k + 1th element of a 1st Fibonacci series.
Axiom 3: All the above different series are converges to Golden ratio.
6. Difference Parallelogram of Fibonacci Numbers
Above difference parallelogram shows Fibonacci series never vanished, which means it exist everlastingly.
7. Matrices in Pascal’s Elements
Let
be an n × n matrix having Pascal’s elements. Where m = n − 1. We called it as Pascal’s matrix.
Now we define Pascal matrix by any variable.
1) NW (North-west Pascal’s matrix)
Let
be an n × n matrix having Pascal’s elements. Where m = n – 1. k is an exponent and “a” is variant.
Now,
.
Jordan normal matrix of A
2) NE (North-East Pascal’s matrix)
Let
be an y × y matrix having Pascal’s elements. Where x = y – 1. k is an exponent and “a” is variant.
Now, inverse for North-East matrix
3) SE (South-East Pascal’s matrix)
Let
be an n × n matrix having Pascal’s elements. Where m = n – 1. k is an exponent and “a” is variant.
Now,
.
4) SW (South-West Pascal’s matrix)
Let
be an y × y matrix having Pascal’s elements. Where x = y – 1. k is an exponent and ‘a’ is variant.
Now, inverse for south-west matrix
Hex numbers:
Let h be any hex number. We know mod 6 of any h is equal to 1.
Mod 6 of h1 ≡ 1; Mod 6 of h2 ≡ 1;
; Mod 6 of hk ≡ 1;
Theorem 1: Difference between any two elements of Hex numbers is fully divided by 6.
Theorem 2:
, where n is integer and 0 ≤
< 6.
Theorem 3: Remainder of arbitrary product of any number of Hex series is always 1 when the product is divided by 6.
Proof:
.
We can say above as
.
Theorem 4:
Theorem 5:
, where Hk is Hex series elements.
Matrices of Hex numbers
Let we see the relation between hex numbers in matrix
1) Let
be a 2 × 2 matrix which elements are hex numbers (where h = 6) then
2) Let
be a 2 × 2 matrix which elements are hex numbers (where h = 6) then
By above way we get,
;
;
;
1) Let we construct a difference triangle about above determinants
a) Let
be a 3 × 3 matrix which elements are hex numbers then
b)
2) Let we construct a difference triangle about above determinants
a) Let
be a 4 × 4 matrix which elements are hex numbers then
b)
3) Let we construct a difference triangle about above determinants
From the above we can state:
a) Determinants of 2 × 2 matrix with hex series elements vanished at 2nd difference.
b) Determinant of 3 × 3 matrix with hex series elements vanished at 0th difference.
c) Determinant of 4 × 4 matrix with hex series elements and above are 0.
Which means hex series elements are forming hexagonal only.
8. Conclusions
1) Fibonacci series never dies. We can generate so many series like Fibonacci series, they also converge to golden ratio. By this way we find so many golden ratio pairs.
2) Matrix with Pascal elements never vanished at any “n” dimensional matrix calculation. For all arithmetic and matrix operation of matrix with Pascal elements never give up its frame. Here frame means the structure of matrix.
3) Sum of kth elements of hex series gives k3and hex series elements form hexagonal only.