Results 161 to 170 of about 1,056,912 (212)

Theory of Binet formulas for Fibonacci and Lucas p-numbers

Chaos, Solitons & Fractals, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexey Stakhov, Boris Rozin
openalex   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Binet's formula for generalized tribonacci numbers

International Journal of Mathematical Education in Science and Technology, 2015
In this note, we derive Binet's formula for the general term Tn of the generalized tribonacci sequence. This formula gives Tn explicitly as a function of the index n, the roots of the associated characteristic equation, and the initial terms T0, T1, and T2.
J. Cereceda
semanticscholar   +2 more sources

Binet’s Formula for the Tribonacci Sequence

The Fibonacci Quarterly, 1982
The terms of a recursive sequence are usually defined by a recurrence procedure; that is, any term is the sum of preceding terms. Such a definition might not be entirely satisfactory, because the computation of any term could require the computation of ...
W. R. Spickerman
semanticscholar   +2 more sources

Quantum m*n-matrices and q-deformed Binet-Cauchy formula

Journal of Physics A: Mathematical and General, 1991
Summary: Quantum multiplicative matrices of size \(m\times n\) are introduced and studied. The \(q\)-generalization of the Binet-Cauchy formula is found.
Sergei Merkulov
openalex   +3 more sources

The k-Periodic Fibonacci Sequence and an Extended Binet's Formula

Integers, 2011
AbstractIt is well known that a continued fraction is periodic if and only if it is the representation of a quadratic ...
Marcia Edson, Scott Lewis, Omer Yayenie
semanticscholar   +3 more sources

A New Generalization of Fibonacci Sequence & Extended Binet's Formula

Integers, 2009
AbstractConsider the Fibonacci ...
Marcia Edson, Omer Yayenie
semanticscholar   +3 more sources

The generalized Pell (p,i)-numbers and their Binet formulas, combinatorial representations, sums

Chaos, Solitons & Fractals, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emrah Kılıç
openalex   +4 more sources

An Elementary Proof of Binet's Formula for the Gamma Function

The American Mathematical Monthly, 1999
(1999). An Elementary Proof of Binet's Formula for the Gamma Function. The American Mathematical Monthly: Vol. 106, No. 2, pp. 156-158.
Z. Sasvári
semanticscholar   +2 more sources

Binet’s Formula for the Recursive Sequence of Order K

The Fibonacci Quarterly, 1984
The terms of a recursive sequence are usually defined by a recurrence procedure; that is, any term is the sum of preceding terms. Such a definition might not be entirely satisfactory, because the computation of any term could require the computation of ...
W. R. Spickerman, R. N. Joyner
semanticscholar   +2 more sources

A bijective proof of generalized Cauchy–Binet, Laplace, Sylvester and Dodgson formulas

Linear and Multilinear Algebra, 2020
In this paper, we give the generalization of Cauchy–Binet, Laplace, Sylvester and generalized Dodgson's condensation formulas for the case of rectangular determinants.
Mahmoud Bayat
openalex   +2 more sources