Results 21 to 30 of about 104,813 (231)
Fibonacci sequences in groupoids [PDF]
Advances in Difference Equations, 2012 Abstract In this article, we consider several properties of Fibonacci sequences in arbitrary groupoids (i.e., binary systems). Such sequences can be defined in a left-hand way and a right-hand way. Thus, it becomes a question of interest to decide when these two ways are equivalent, i.e., when they produce the same sequence for the same ...
Hee Sik Kim +2 more
openaire +2 more sources
Accelerations of Generalized Fibonacci Sequences [PDF]
The Fibonacci Quarterly, 2011 In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence (g_n) of order 2.
Marco Abrate +3 more
openaire +4 more sources
Generalized Fibonacci sequences in groupoids [PDF]
Advances in Difference Equations, 2013 Abstract In this paper, we introduce the notion of generalized Fibonacci sequences over a groupoid and discuss it in particular for the case where the groupoid contains idempotents and pre-idempotents. Using the notion of Smarandache-type P-algebra, we obtain several relations on groupoids which are derived from generalized Fibonacci ...
Keum Sook So +2 more
openaire +2 more sources
On the 2k-step Jordan-Fibonacci sequence
Advances in Difference Equations, 2017 In this paper, we define the 2k-step Jordan-Fibonacci sequence, and then we study the 2k-step Jordan-Fibonacci sequence modulo m. Also, we obtain the cyclic groups from the multiplicative orders of the generating matrix of the 2k-step Jordan-Fibonacci ...
Omur Deveci, Sait Taş, A Kılıçman
doaj +1 more source
Generalized Fibonacci-like sequence and Fibonacci sequence
International Journal of Contemporary Mathematical Sciences, 2014 Every term in the Fibonacci Sequence can be determined recursively with the help of initial values F0 = 0, F1 = 1. Similar is the case with Lucas Sequence. In this paper, we study Generalized Fibonacci-Like sequence {Dn} defined by the recurrence relation Dn = Dn-1 + Dn-2, for all n 2 with D0 = 2 and D1 = 1+m, m being a fixed positive integer.
Sanjay Harne +2 more
openaire +2 more sources
Conway's Subprime Fibonacci Sequences [PDF]
Mathematics Magazine, 2014 18 pages, 5 ...
Julian Salazar +2 more
openaire +4 more sources
On ideal convergence Fibonacci difference sequence spaces
Advances in Difference Equations, 2018 The Fibonacci sequence was firstly used in the theory of sequence spaces by Kara and Başarir (Casp. J. Math. Sci. 1(1):43–47, 2012). Afterward, Kara (J. Inequal. Appl.
Vakeel A. Khan +4 more
doaj +1 more source
On the characteristic polynomial of ( k , p ) $(k,p)$ -Fibonacci sequence
Advances in Difference Equations, 2021 Recently, Bednarz introduced a new two-parameter generalization of the Fibonacci sequence, which is called the ( k , p ) $(k,p)$ -Fibonacci sequence and denoted by ( F k , p ( n ) ) n ≥ 0 $(F_{k,p}(n))_{n\geq0}$ .
Pavel Trojovský
doaj +1 more source
Kin Competition Drives the Evolution of Earlier Metamorphosis. [PDF]
Ecol EvolWe develop a mathematical model to investigate how kin selection shapes the optimal timing of metamorphosis. We consider the full range of larval competition intensities and the full range of relatedness coefficients. This yields testable predictions as to how kin selection modulates the timing of metamorphosis.
Dong B, Gardner A.
europepmc +2 more sources
Weak disorder in Fibonacci sequences [PDF]
Journal of Physics A: Mathematical and General, 2006 4 pages, 2 ...
Eli Ben-Naim, Paul L. Krapivsky
openaire +3 more sources