Results 1 to 10 of about 242,259 (303)

Lucas sequences and repdigits [PDF]

open access: yesMathematica Bohemica, 2022
Let $(G_n)_{n \geq1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\{U_n\}$ and $\{V_n\}$, respectively.
Hayder Raheem Hashim, Szabolcs Tengely
doaj   +3 more sources

Coincidences in generalized Lucas sequences [PDF]

open access: yesThe Fibonacci Quarterly, 2014
For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms.
Bravo, Eric F.   +2 more
core   +2 more sources

On a divisibility relation for Lucas sequences

open access: greenJournal of Number Theory, 2016
In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.
Yuri Bilu   +4 more
openalex   +6 more sources

The GCD Sequences of the Altered Lucas Sequences [PDF]

open access: yesAnnales 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   +2 more sources

Primitive divisors of Lucas and Lehmer sequences [PDF]

open access: yesMathematics of Computation, 1995
Stewart reduced the problem of determining all Lucas and Lehmer sequences whose $n$-th element does not have a primitive divisor to solving certain Thue equations.
Par Paul M Voutier, Paul M. Voutier
core   +17 more sources

Almost powers in the Lucas sequence [PDF]

open access: bronzeJournal de Théorie des Nombres de Bordeaux, 2008
The {\it Lucas sequence} $(L_n)_{n\geq 0}$ is defined by $L_0=2, L_1=1$ and $L_n=L_{n-1}+L_{n-2}$ for $n\geq 2$. The first, third and fourth authors have proved, among other things, that the only perfect powers in the Lucas sequence are $L_1=1$ and $L_3=4$ [{\it Y. Bugeaud, M. Mignotte} and {\it S. Siksek}, Ann. Math. (2) 163, No.
Yann Bugeaud   +3 more
openalex   +4 more sources

A generalization of Lucas polynomial sequence

open access: bronzeDiscrete Applied Mathematics, 2008
In this paper, we obtain a generalized Lucas polynomial sequence from the lattice paths for the Delannoy numbers by allowing weights on the steps (1,0),(0,1) and (1,1). These weighted lattice paths lead us to a combinatorial interpretation for such a Lucas polynomial sequence. The concept of Riordan arrays is extensively used throughout this paper.
Gi‐Sang Cheon   +2 more
openalex   +3 more sources

Shifted powers in Lucas–Lehmer sequences [PDF]

open access: greenResearch in Number Theory, 2019
We develop a general framework for finding all perfect powers in sequences derived by shifting non-degenerate quadratic Lucas-Lehmer binary recurrence sequences by a fixed integer. By combining this setup with bounds for linear forms in logarithms and results based upon the modularity of elliptic curves defined over totally real fields, we are able to ...
Michael A. Bennett   +2 more
openalex   +6 more sources

A Sequence Bounded Above by the Lucas Numbers

open access: yesSakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2018
In this work, we consider the sequence whosenthterm isthe number of h-vectors of length n. The set of integer vectors E(n)isintroduced. For, n>=2,the cardinality ofE(n)is the nthLucasnumber Lnisshowed.
Ali Aydoğdu   +2 more
doaj   +5 more sources

Home - About - Disclaimer - Privacy