Results 11 to 20 of about 1,804,204 (295)
On Generalized Fibonacci Numbers
Communications in Advanced Mathematical Sciences, 2020 Fibonacci numbers and their polynomials have been generalized mainly by two ways: by maintaining the recurrence relation and varying the initial conditions, and by varying the recurrence relation and maintaining the initial conditions. In this paper, we
Isaac Owino Okoth, Fidel Oduol
doaj +4 more sources
On Quaternion-Gaussian Fibonacci Numbers and Their Properties
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 We study properties of Gaussian Fibonacci numbers. We start with some basic identities. Thereafter, we focus on properties of the quaternions that accept gaussian Fibonacci numbers as coefficients.
Halici Serpil, Cerda-Morales Gamaliel
doaj +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
2-Fibonacci polynomials in the family of Fibonacci numbers [PDF]
Notes on Number Theory and Discrete Mathematics, 2018 In the present study, we define new 2-Fibonacci polynomials by using terms of a new family of Fibonacci numbers given in [4]. We show that there is a relationship between the coefficient of the 2-Fibonacci polynomials and Pascal’s triangle.
E. Özkan, Merve Taştan, A. Aydoğdu
semanticscholar +2 more sources
Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
, 2002 A permutation $ \in S_n$ is said to {\it avoid} a permutation $ \in S_k$ whenever $ $ contains no subsequence with all of the same pairwise comparisons as $ $. For any set $R$ of permutations, we write $S_n(R)$ to denote the set of permutations in $S_n$ which avoid every permutation in $R$. In 1985 Simion and Schmidt showed that $|S_n(132, 213, 123)
Egge, Eric S., Mansour, Toufik
openaire +4 more sources
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
On Bicomplex Fibonacci Numbers and Their Generalization
Models and Theories in Social Systems, 2018 In this chapter, we consider bicomplex numbers with coefficients from Fibonacci sequence and give some identities. Moreover, we demonstrate the accuracy of such identities by taking advantage of idempotent representations of the bicomplex numbers. And then by this representation, we give some identities containing these numbers.
S. Halıcı
semanticscholar +7 more sources
Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers [PDF]
, 2005 In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.
Egge, Eric C., Mansour, Toufik
openaire +2 more sources
The Fibonacci numbers of certain subgraphs of circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2015 The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo +1 more
doaj +2 more sources
The p-Frobenius and p-Sylvester numbers for Fibonacci and Lucas triplets. [PDF]
Mathematical biosciences and engineering : MBE, 2022 In this paper we study a certain kind of generalized linear Diophantine problem of Frobenius. Let $ a_1, a_2, \dots, a_l $ be positive integers such that their greatest common divisor is one.
T. Komatsu, Ha Ying
semanticscholar +1 more source