Results 101 to 110 of about 976 (217)
Determinants Containing Powers of Generalized Fibonacci Numbers
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
This paper describes the theory, method and customary knowledge behind the design of a global systems change network grounded in Indigenous relational processes. The project leverages nested cohorts of human and nonhuman agents, affiliated through ancient borderwork protocols within biocultural governance structures.
T. Yunkaporta +4 more
wiley +1 more source
On the growth rate of generalized Fibonacci numbers
Let α(t) be the limiting ratio of the generalized Fibonacci numbers produced by summing along lines of slope t through the natural arrayal of Pascal's triangle. We prove that is an even function.
Fishkind Donniell E
doaj +2 more sources
The period of the Fibonacci random number generator
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
A Generalization of Gaussian Balancing and Gaussian Balancing‐Lucas Numbers With Applications
In this paper, we study a generalization of Gaussian balancing and Gaussian Lucas‐balancing numbers, we find their generating functions, Binet formulas, related matrix representation, and many other properties. Also, we provide some applications in cryptography.
T. Al-Asoully +2 more
wiley +1 more source
Generalized Gaussian Fibonacci numbers and sums by matrix methods [PDF]
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix methods and then obtain the Binet formulas and combinatorial representations of the generalizations of these number sequence.
Aşcı, Mustafa, Lee, G.Y.
core
Photovoltaic technology is one of the most pioneering renewable methods for electricity generation. This technology has gained substantial attention over the past decade due to the significant decline in the cost of PV power plant construction. Consequently, a lot of studies focusing on the investigation and optimization of PV systems have been ...
Maryam Chinipardaz +3 more
wiley +1 more source
The Lucas collocation approach is used in this study to approximate a fractional‐order financial crime model (FOFCM) numerically. The model categorizes the population into five groups: persons without a financial criminal past, those inclined toward financial crimes, active participants, individuals undergoing prosecution, and those imprisoned.
Mahmoud Abd El-Hady +4 more
wiley +1 more source
On sums and reciprocal sum of generalized fibonacci numbers [PDF]
The purpose of this report is to analyze the properties of Fibonacci numbers modulo a Lucas numbers. Any Fibonacci number, except the first two, is the sum of the two immediately preceding Fibonacci numbers and closely related to Fibonacci numbers are ...
Mandal, B P
core
Binomial transform of the generalized k-Fibonacci numbers [PDF]
We recall the concept and some properties of the generalized k-Fibonacci numbers and then apply the binomial transform to these sequences. As consequence, we obtain new integer sequences related to the generalized k -Fibonacci numbers.
Falcon, Sergio
core +1 more source

