Results 21 to 30 of about 3,822 (183)
On Recursive Hyperbolic Fibonacci Quaternions
Communications in Advanced Mathematical Sciences, 2021 Many quaternions with the coefficients selected from special integer sequences such as Fibonacci and Lucas sequences have been investigated by a great number of researchers.
Ahmet Daşdemir
doaj +1 more source
On the intersections of Fibonacci, Pell, and Lucas numbers [PDF]
, 2010 We describe how to compute the intersection of two Lucas sequences of the forms $\{U_n(P,\pm 1) \}_{n=0}^{\infty}$ or $\{V_n(P,\pm 1) \}_{n=0}^{\infty}$ with $P\in\mathbb{Z}$ that includes sequences of Fibonacci, Pell, Lucas, and Lucas-Pell numbers.
Bilu +13 more
core +2 more sources
On some links between the generalised Lucas pseudoprimes of level k
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 Pseudoprimes are composite integers sharing behaviours of the prime numbers, often used in practical applications like public-key cryptography. Many pseudoprimality notions known in the literature are defined by recurrent sequences.
Andrica Dorin +2 more
doaj +1 more source
Diophantine equations with Lucas and Fibonacci number coefficients [PDF]
Notes on Number Theory and Discrete MathematicsFibonacci and Lucas numbers are special number sequences that have been the subject of many studies throughout history due to the relations they provide.
Cemil Karaçam +3 more
doaj +1 more source
On Hessenberg and pentadiagonal determinants related with Fibonacci and Fibonacci-like numbers [PDF]
, 2014 In this paper, we establish several new connections between the generalizations of Fibonacci and Lucas sequences and Hessenberg determinants. We also give an interesting conjecture related to the determinant of an infinite pentadiagonal matrix with the ...
Arı, Kamil, İpek, Ahmet
core +1 more source
Generalized Fibonacci and Lucas Sequences and Rootfinding Methods [PDF]
Mathematics of Computation, 1993 Consider the sequences{un}\{ {u_n}\}and{vn}\{ {v_n}\}generated byun+1=pun−qun−1{u_{n + 1}} = p{u_n} - q{u_{n - 1}}andvn+1=pvn−qvn−1,n≥1{v_{n + 1}} = p{v_n} - q{v_{n - 1}},n \geq 1, whereu0=0,u1=1,v0=2,v1=p{u_0} = 0,{u_1} = 1,{v_0} = 2,{v_1} = p, withpandqreal and nonzero.
openaire +1 more source
New summation identities of hyperbolic k-Fibonacci and k-Lucas quaternions [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper, we introduce a set of identities involving hyperbolic k-Fibonacci quaternions and k-Lucas quaternions. Moreover, we derive summation identities for hyperbolic k-Fibonacci and k-Lucas quaternions by utilizing established properties of k ...
A. D. Godase
doaj +1 more source
On some new results for the generalised Lucas sequences
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits ...
Andrica Dorin +2 more
doaj +1 more source
The Fibonacci numbers of certain subgraphs of circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2015 The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo +1 more
doaj +1 more source
Smarandache Sequences: Explorations and Discoveries with a Computer Algebra System [PDF]
, 2000 Study of Smarandache sequences of numbers, and related problems, via a Computer Algebra. Sy::;tem.
Gouveia, Paulo, Torres, Delfim
core +1 more source