Results 91 to 100 of about 1,912,276 (202)
Applied Computational Intelligence and Soft Computing, Volume 2026, Issue 1, 2026.Scheduling is an important aspect in cloud computing paradigm as different heterogeneous devices will send tasks to the cloud platform. All these different devices that generate tasks are not of the same type in terms of power backup, computational capacity, link failures, etc.
Sudheer Mangalampalli +4 more
wiley +1 more source
The period of the Fibonacci random number generator
Discrete Applied Mathematics, 1988 The Fibonacci random number generator \(r_ n\equiv r_{n-1}+r_{n- k}(mod M)\) is in focus in this paper. For M prime and some choices of k, any non-zero starting vector \(v=(r_ 1,...,r_ k)\) for integers creates a sequence of maximal period M k-1. In most cases, however, different v's give rise to different periods.
openaire +1 more source
Determinants Containing Powers of Generalized Fibonacci Numbers
J. Integer Seq., 2015 We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These studies have led us to discover a fundamental identity of determinant involving powers of linear polynomials. Finally,
Aram Tangboonduangjit +1 more
openaire +4 more sources
A Combinatorial Interpretation of the Generalized Fibonacci Numbers
Advances in Applied Mathematics, 1997 The author considers the Fibonacci numbers of order \(k\), i.e., the numbers \(F^{(k)}_n\) defined by the recurrence relation \(F^{(k)}_{n+ k}= F_{n+k-1}^{(k)}+ F_{n+ k-2}^{(k)}+\cdots+ F_{n+1}^{(k)}+ F^{(k)}_n\) and, as in \textit{D. E. Knuth} [The art of computer programming, Vol. 3, Addison-Wesley (1974; Zbl 0302.68010)], by the initial conditions \(
openaire +3 more sources
Closed forms for finite sums of weighted products of generalized Fibonacci numbers [PDF]
, 2017 In this paper, we present closed forms for certain finite sums of weighted products of generalized Fibonacci numbers. Indeed, we present seven multi-parameter families of such finite sums, all of which we believe to be new. In each of these families, the
Melham, RS
core
On Some Inequalities with Fibonacci Numbers via Weighted Reverse Hölder Inequalities
Annales Mathematicae SilesianaeIn this paper, we introduce new inequalities for weighted sums of powers. By utilizing known Fibonacci identities alongside our generalized inequalities, we derive new sequences of inequalities for Fibonacci numbers.
Pribanić Anamarija Perušić
doaj +1 more source
, 1981 The matrices of Fibonacci numbers (called windows) possess some unusual properties which are not shared by normal matrices, such as commutativity under multiplication and +1 for all determinants.
M.C. Er
core
Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
, 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 +1 more source
Generalized Fibonacci Numbers: Sum Formulas
, 2020 In this paper, closed forms of the summation formulas for generalized Fibonacci numbers are presented. As special cases, we give summation formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers.
Yüksel Soykan
core +1 more source
Generalization of the Distance Fibonacci Sequences
AxiomsIn this study, we introduced a generalization of distance Fibonacci sequences and investigate some of its basic properties. We then proposed a generalization of distance Fibonacci sequences for negative integers and investigated some basic properties ...
Nur Şeyma Yilmaz +2 more
doaj +1 more source