Results 11 to 20 of about 104,813 (231)
Universal Journal of Mathematics and Applications, 2019 In this paper, we investigate the hyperbolic Fibonacci sequence and the hyperbolic Fibonacci numbers. Furthermore, we give recurrence relations, the golden ratio and Binet's formula for the hyperbolic Fibonacci sequence and Lorentzian inner product ...
Fügen Torunbalcı Aydın
doaj +6 more sources
Fibonacci Modules and Multiple Fibonacci Sequences [PDF]
arXiv, 2008 Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.
arxiv +3 more sources
Free Fibonacci Sequences [PDF]
arXiv, 2014 This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze these sequences for small n: 2, 3, 4, and 5. Surprisingly these behaviors are very different.
Avila, Brandon, Khovanova, Tanya
arxiv +3 more sources
Generalized Fibonacci Sequences and Binet-Fibonacci Curves [PDF]
arXiv, 2017 We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with congruent indices we derived general formula in terms of generalized Fibonacci polynomials and Lucas numbers.
Özvatan, Merve, Pashaev, Oktay K.
arxiv +3 more sources
On the pulsating (m,c)-Fibonacci sequence. [PDF]
Heliyon, 2021 In this paper, we study new ideas in the generalization of additive and multiplicative pulsating Fibonacci sequences. Then, we construct two types of pulsating Fibonacci sequences of the mth order. Moreover, the closed forms of the two sequences are derived by basic linear algebra.
Laipaporn K +2 more
europepmc +6 more sources
Generalized Fibonacci – Like Sequence Associated with Fibonacci and Lucas Sequences [PDF]
Turkish Journal of Analysis and Number Theory, 2015 The Fibonacci sequence, Lucas numbers and their generalization have many interesting properties and applications to almost every field. Fibonacci sequence is defined by the recurrence formula Fn=Fn-1+Fn-2, , and F0=0, F1=1, where Fn is a nth number of sequence.
Yogesh Kumar Gupta +2 more
openalex +2 more sources
The golden ratio in the pulmonary circulation in patients with heart failure and cardiogenic shock. [PDF]
Physiol RepStroke volume is a determinant of both mPAP (left wireframe plot) and PP (right surface plot). Mean pulmonary artery pressure changes with SV with a coefficient of (PVR/t, where t = cardiac interval). The mPAP plot is based on a PVR of 4.2WU (or 0.252 mmHg/mL.s) at cardiac intervals from 400 to 1000 ms and PAWP of 29 mmHg.
Lim HS, Yim IHW.
europepmc +2 more sources
Random Fibonacci sequences [PDF]
Journal of Physics A: Mathematical and General, 2001 Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent lambda(B) in powers of B and B^{-1}, respectively.
Sire, Clément, Krapivsky, Paul L.
openaire +4 more sources
Journal of Applied Crystallography, Volume 55, Issue 6, Page 1677-1688, December 2022., 2022 Recent enhancements and additions to the SASfit program are discussed, including anisotropic scattering models, flexible distributions, regularization techniques such as the expectation‐maximization method, and new structure factors, especially for ordered nano‐ and meso‐scaled material.
Joachim Kohlbrecher, Ingo Breßler
wiley +1 more source
Optimal Control and the Fibonacci Sequence [PDF]
Journal of Optimization Theory and Applications, 2012 We bridge mathematical number theory with optimal control and show that a generalised Fibonacci sequence enters the control function of finite-horizon dynamic optimisation problems with one state and one control variable. In particular, we show that the recursive expression describing the first-order approximation of the control function can be written
Thomas von Brasch +3 more
openaire +7 more sources