Results 91 to 100 of about 1,044,414 (185)

Fibonacci facts and formulas [PDF]

open access: yes
We investigate several methods of computing Fibonacci numbers quickly and generalize some properties of the Fibonacci numbers to degree r Fi­bonacci (R-nacci) numbers. Sections 2 and 3 present several algorithms for computing the traditional, degree two,
Capocelli, R. M.   +3 more
core   +1 more source

A generalization of the Binet-Minc formula for the evaluation of permanents

open access: yesLinear Algebra and its Applications, 1988
The author presents a formula which coincides with the Binet-Minc formula for the evaluation of the permanent of the matrix \((a_{ij})\) which is presented in the polynomial \(\prod^{n}_{i=1}(\sum^{m}_{j=1}a_{ij}x_ j)\) where this formula is considered for the sum of the coefficients of monomials of the form \(x^{j_ 1}_{\ell_ 1}...x^{j_ p}_{\ell_ p ...
openaire   +2 more sources

The Representation, Generalized Binet Formula and Sums of The Generalized Jacobsthal p-Sequence

open access: yesHittite Journal of Science and Engineering, 2016
In this study, a new generalization of the usual Jacobsthal sequence is presented, which is called the generalized Jacobsthal Binet formula, the generating functions and the combinatorial representations of the generalized Jacobsthal p-sequence are investigated.
openaire   +3 more sources

Cauchy-Binet type formulas for Fredholm operators [PDF]

open access: yesJournal of Applied Mathematics and Computational Mechanics, 2017
openaire   +2 more sources

Some properties of hyper-dual and bicomplex numbers with Leonardo number components [PDF]

open access: yes
Bu tez beş bölümden oluşmaktadır. İlk bölümde tezin giriş kısmına ayrılmıştır. İkinci bölümde, hiper dual Leonardo sayıları ve bikompleks Leonardo sayılarını daha iyi anlayabilmemiz adına gerekli temel tanım ve kavramlara ayrılmıştır.
Turan, Murat
core   +1 more source

A Unified Explicit Binet Formula for 3rd-Order Linear Recurrence Relations

open access: yesAdvances in Analysis and Applied Mathematics
In this paper, third order generalized linear recurrence relation Vn (aj , pj) = p1Vn−1 + p2Vn−2 + p3Vn−3, p3 ≠ 0, is studied to generate a generalized Tribonacci sequence, where pj , Vj = aj are arbitrary integers. Generalized generating function for the 3rd order general tribonacci sequence is derived, and then new unified explicit generalized Binet ...
openaire   +1 more source

Note on Binet's Inverse Factorial Series for μ(x)

open access: yesProceedings of the Edinburgh Mathematical Society, 1924
E. Copson
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy