Results 31 to 40 of about 143 (119)
On the power sum problem of Lucas polynomials and its divisible property
Open Mathematics, 2018 The main purpose of this paper is to use the mathematical induction and the properties of Lucas polynomials to study the power sum problem of Lucas polynomials. In the end, we obtain an interesting divisible property.
Xiao Wang
doaj +1 more source
Fascinating Number Sequences from Fourth Order Difference Equation Via Quaternion Algebras
Discussiones Mathematicae - General Algebra and Applications, 2021 The balancing and Lucas-balancing numbers are solutions of second order recurrence relations. A linear combination of these numbers can also be obtained as solutions of a fourth order recurrence relation.
Patra Asim
doaj +1 more source
Extended Fibonacci numbers and polynomials with probability applications
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 50, Page 2681-2693, 2004., 2004 The extended Fibonacci sequence of numbers and polynomials is introduced and studied. The generating function, recurrence relations, an expansion in terms of multinomial coefficients, and several properties of the extended Fibonacci numbers and polynomials are obtained.
Demetrios L. Antzoulakos
wiley +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 39, Page 2507-2518, 2003., 2003 We prove that powers of 4‐netted matrices (the entries satisfy a four‐term recurrence δai,j = αai−1,j + βai−1,j + γai,j−1) preserve the property of nettedness: the entries of the eth power satisfy δeai,j(e)=αeai−1,j(e)+βeai−11,j−(e)+γeai,j−1(e), where the coefficients are all instances of the same sequence xe+1 = (β + δ)xe − (βδ + αγ)xe−1.
Pantelimon Stănică
wiley +1 more source
A note on Fibonacci matrices of even degree
International Journal of Mathematics and Mathematical Sciences, Volume 27, Issue 8, Page 457-469, 2001., 2001 This paper presents a construction of m‐by‐m irreducible Fibonacci matrices for any even m. The proposed technique relies on matrix representations of algebraic number fields which are an extension of the golden section field. The explicit construction of some 6‐by‐6 and 8‐by‐8 irreducible Fibonacci matrices is given.
Michele Elia
wiley +1 more source
, 2010 11 páginas.-- 2010 Mathematics subject classification: Primary 11N25; Secondary 11B39.A Lehmer number is a composite positive integer n such that ϕ(n)|n − 1.
Cilleruelo, Javier +3 more
core +1 more source
The GCD Sequences of the Altered Lucas Sequences
Annales Mathematicae Silesianae, 2020 In this study, we give two sequences {L+n}n≥1 and {L−n}n≥1 derived by altering the Lucas numbers with {±1, ±3}, terms of which are called as altered Lucas numbers.
Koken Fikri
doaj +1 more source
A curious property of series involving terms of generalized sequences
International Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 1, Page 55-63, 2000., 2000 Here we are concerned with series involving generalized Fibonacci numbers Un (p, q) and generalized Lucas numbers Vn (p, q). The aim of this paper is to find triples (p, q, r) for which the series Un (p, q)/rn and Vn (p, q)/rn (for r running from 0 to infinity) are unconcerned at the introduction of the factor n.
Odoardo Brugia, Piero Filipponi
wiley +1 more source
The Hybrid Numbers of Padovan and Some Identities
Annales Mathematicae Silesianae, 2020 In this article, we will define Padovan’s hybrid numbers, based on the new noncommutative numbering system studied by Özdemir ([7]). Such a system that is a set involving complex, hyperbolic and dual numbers.
Mangueira Milena Carolina dos Santos +3 more
doaj +1 more source
Stability of second‐order recurrences modulo pr
International Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 4, Page 225-241, 2000., 2000 The concept of sequence stability generalizes the idea of uniform distribution. A sequence is p‐stable if the set of residue frequencies of the sequence reduced modulo pr is eventually constant as a function of r. The authors identify and characterize the stability of second‐order recurrences modulo odd primes.
Lawrence Somer, Walter Carlip
wiley +1 more source