scholarly journals On the arrowhead-Fibonacci numbers

2016 ◽  
Vol 14 (1) ◽  
pp. 1104-1113 ◽  
Author(s):  
Inci Gültekin ◽  
Ömür Deveci
Keyword(s):  
Characteristic Polynomial ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Cyclic Groups ◽  
Generating Matrix ◽  
Arrowhead Matrix

AbstractIn this paper, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix of the characteristic polynomial of the k-step Fibonacci sequence and then we give some of their properties. Also, we study the arrowhead-Fibonacci sequence modulo m and we obtain the cyclic groups from the generating matrix of the arrowhead-Fibonacci numbers when read modulo m. Then we derive the relationships between the orders of the cyclic groups obtained and the periods of the arrowhead-Fibonacci sequence modulo m.

scholarly journals The arrowhead-Jacobsthal sequence

2021 ◽  
Vol 51 ◽  
pp. 31-44
Author(s):  
Yesım Akuzum ◽  
Omur Deveci
Keyword(s):  
Characteristic Polynomial ◽  
Generating Matrix ◽  
Arrowhead Matrix ◽  
Generalized Order

In the present investigation, we define the arrowhead-Jacobsthal sequence by the arrowhead matrix defined with the help of the characteristic polynomial of the generalized order-k Jacobsthal numbers. Next, we derive various properties of the arrowhead-Jacobsthal sequence by using its generating matrix. Also, we give connections between Fibonacci, Jacobsthal, Pell and arrowhead-Jacobsthal numbers.

scholarly journals On the Sum of Powers of Two k-Fibonacci Numbers which Belongs to the Sequence of k-Lucas Numbers

2016 ◽  
Vol 67 (1) ◽  
pp. 41-46
Author(s):  
Pavel Trojovský
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Lucas Numbers ◽  
Initial Values ◽  
Lucas Sequence ◽  
Positive Integers

Abstract Let k ≥ 1 and denote (Fk,n)n≥0, the k-Fibonacci sequence whose terms satisfy the recurrence relation Fk,n = kFk,n−1 +Fk,n−2, with initial conditions Fk,0 = 0 and Fk,1 = 1. In the same way, the k-Lucas sequence (Lk,n)n≥0 is defined by satisfying the same recurrence relation with initial values Lk,0 = 2 and Lk,1 = k. These sequences were introduced by Falcon and Plaza, who showed many of their properties, too. In particular, they proved that Fk,n+1 + Fk,n−1 = Lk,n, for all k ≥ 1 and n ≥ 0. In this paper, we shall prove that if k ≥ 1 and $F_{k,n + 1}^s + F_{k,n - 1}^s \in \left( {L_{k,m} } \right)_{m \ge 1} $ for infinitely many positive integers n, then s =1.

scholarly journals On Fibonacci Numbers and its Applications

2019 ◽  
Vol 8 (12) ◽  
pp. 453-455
Keyword(s):  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Generalized Fibonacci Sequence

In this article, we explore the representation of the product of k consecutive Fibonacci numbers as the sum of kth power of Fibonacci numbers. We also present a formula for finding the coefficients of the Fibonacci numbers appearing in this representation. Finally, we extend the idea to the case of generalized Fibonacci sequence and also, we produce another formula for finding the coefficients of Fibonacci numbers appearing in the representation of three consecutive Fibonacci numbers as a particular case. Also, we point out some amazing applications of Fibonacci numbers.

scholarly journals Non-standard Aspects of Fibonacci Type Sequences

KoG ◽  
2017 ◽  
pp. 26-34
Author(s):  
Gunter Weiss
Keyword(s):  
Number Field ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
General Knowledge ◽  
Real Numbers ◽  
Number Series ◽  
Golden Mean ◽  
Quadratic Equations ◽  
Geometric Objects ◽  
Art And Architecture

Fibonacci sequence and the limit of the quotient of adjacent Fibonacci numbers, namely the Golden Mean, belong to general knowledge of almost anybody, not only of mathematicians and geometers. There were several attempts to generalize these fundamental concepts which also found applications in art and architecture, as e.g. number series and quadratic equations leading to the so-called ``Metallic means'' by V. de Spinadel [8] or the cubic ``plastic number'' by van der Laan [5] resp. the ``cubi ratio'' by L. Rosenbusch [7]. The mentioned generalisations consider series of integers or real numbers. ``Non-standard aspects'' now mean generalisations with respect to a given number field or ring as well as visualisations of the resulting geometric objects. Another aspect concerns Fibonacci type resp. Padovan type combinations of given start objects. Here it turns out that the concept ``Golden Mean'' or ``van der Laan Mean'' also makes sense for vectors, matrices and mappings.

scholarly journals Some Diophantine Problems Related to k-Fibonacci Numbers

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1047
Author(s):  
Pavel Trojovský ◽  
Štěpán Hubálovský
Keyword(s):  
Recurrence Relation ◽  
Diophantine Equations ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Recursive Relation ◽  
Initial Values ◽  
Lucas Sequence ◽  
Diophantine Problems ◽  
Positive Integers

Let k ≥ 1 be an integer and denote ( F k , n ) n as the k-Fibonacci sequence whose terms satisfy the recurrence relation F k , n = k F k , n − 1 + F k , n − 2 , with initial conditions F k , 0 = 0 and F k , 1 = 1 . In the same way, the k-Lucas sequence ( L k , n ) n is defined by satisfying the same recursive relation with initial values L k , 0 = 2 and L k , 1 = k . The sequences ( F k , n ) n ≥ 0 and ( L k , n ) n ≥ 0 were introduced by Falcon and Plaza, who derived many of their properties. In particular, they proved that F k , n 2 + F k , n + 1 2 = F k , 2 n + 1 and F k , n + 1 2 − F k , n − 1 2 = k F k , 2 n , for all k ≥ 1 and n ≥ 0 . In this paper, we shall prove that if k > 1 and F k , n s + F k , n + 1 s ∈ ( F k , m ) m ≥ 1 for infinitely many positive integers n, then s = 2 . Similarly, that if F k , n + 1 s − F k , n − 1 s ∈ ( k F k , m ) m ≥ 1 holds for infinitely many positive integers n, then s = 1 or s = 2 . This generalizes a Marques and Togbé result related to the case k = 1 . Furthermore, we shall solve the Diophantine equations F k , n = L k , m , F k , n = F n , k and L k , n = L n , k .

scholarly journals From Fibonacci Sequence to the Golden Ratio

2013 ◽  
Vol 2013 ◽  
pp. 1-3 ◽  
Author(s):  
Alberto Fiorenza ◽  
Giovanni Vincenzi
Keyword(s):  
Characteristic Polynomial ◽  
Golden Ratio ◽  
Fibonacci Sequence ◽  
Maximum Modulus ◽  
Point Of View ◽  
General Point ◽  
Constant Coefficients ◽  
The Difference ◽  
New Perspective

We consider the well-known characterization of the Golden ratio as limit of the ratio of consecutive terms of the Fibonacci sequence, and we give an explanation of this property in the framework of the Difference Equations Theory. We show that the Golden ratio coincides with this limit not because it is the root with maximum modulus and multiplicity of the characteristic polynomial, but, from a more general point of view, because it is the root with maximum modulus and multiplicity of a restricted set of roots, which in this special case coincides with the two roots of the characteristic polynomial. This new perspective is the heart of the characterization of the limit of ratio of consecutive terms of all linear homogeneous recurrences with constant coefficients, without any assumption on the roots of the characteristic polynomial, which may be, in particular, also complex and not real.

scholarly journals Musica fibonacciana: Aesthetic and practical approach

New Sound ◽  
2017 ◽  
pp. 70-90
Author(s):  
Rima Povilionienè
Keyword(s):  
Music Composition ◽  
Golden Ratio ◽  
Fibonacci Numbers ◽  
Laws Of Nature ◽  
Fibonacci Sequence ◽  
Number Sequences ◽  
Music And Mathematics ◽  
To Come ◽  
Composition Structure ◽  
And Mathematics

In the sphere of musical research, the intersection of two seemingly very different subject areas-music and mathematics is in essence related to one of the trends of music-attributing the theory of music to science, to the sphere of mathematica. It is regarded the longest-lasting interdisciplinary dialogue. The implication of numerical proportions and number sequences in the music composition of different epochs is closely related to this sphere. A significant role in creating music was attributed to the so-called infinite Fibonacci sequence. Perhaps the most important feature of the Fibonacci numbers, which attracted the attention of thinkers and creators of different epochs, is the fact that by means of the ratio between them it is possible to come maximally close to the Golden Ratio formula, which expresses the laws of nature. On a practical plane, often the climax, the most important part of any composition, matches the point of the Golden Ratio; groups of notes, rhythm, choice of tone pitches, a grouping of measures, time signature, as well as proportions between a musical composition's parts may be regulated according to Fibonacci principles. The article presents three analytical cases-Chopin's piano prelude, Bourgeois' composition for organ, and Reich's minimalistic piece, attempting to render music composition structure to the logic of Fibonacci numbers.

scholarly journals The Proof of a Conjecture on the Density of Sets Related to Divisibility Properties of z(n)

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2912
Author(s):  
Eva Trojovská ◽  
Venkatachalam Kandasamy
Keyword(s):  
Positive Integer ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Natural Density ◽  
Almost All ◽  
Divisibility Properties

Let (Fn)n be the sequence of Fibonacci numbers. The order of appearance (in the Fibonacci sequence) of a positive integer n is defined as z(n)=min{k≥1:n∣Fk}. Very recently, Trojovská and Venkatachalam proved that, for any k≥1, the number z(n) is divisible by 2k, for almost all integers n≥1 (in the sense of natural density). Moreover, they posed a conjecture that implies that the same is true upon replacing 2k by any integer m≥1. In this paper, in particular, we prove this conjecture.

scholarly journals Fibonacci, tribonacci, …, hexanacci and parallel “error-free” machine arithmetic

2019 ◽  
Vol 43 (6) ◽  
pp. 1072-1078 ◽  
Author(s):  
V.M. Chernov
Keyword(s):  
Characteristic Polynomial ◽  
Fibonacci Sequence ◽  
Parallel Computations ◽  
New Method ◽  
Direct Sum ◽  
Number Systems ◽  
Residue Number Systems ◽  
Residue Number ◽  
The Difference ◽  
Free Machine

The paper proposes a new method of synthesis of machine arithmetic systems for “error-free” parallel computations. The difference of the proposed approach from calculations in traditional Residue Number Systems (RNS) for the direct sum of rings is the parallelization of calculations in finite reductions of non-quadratic global fields whose elements are represented in number systems generated by sequences of powers of roots of the characteristic polynomial for the n-Fibonacci sequence.

Sign in / Sign up

Export Citation Format

Share Document