“…In this paper, we study a similar problem to that of Kafle, et al [11], but with the Lucas numbers instead of the Fibonacci numbers. That is, we show that there is at most one value of the positive integer x participating in (1.3), which is a product of two Lucas numbers, with a few exceptions that we completely characterize.…”
Section: Resultsmentioning
confidence: 99%
“…This is sequence A000032 on the On-Line Encyclopedia of Integer Sequences (OEIS) [19]. The first few terms of this sequence are 3,4,7,11,18,29,47,76,123,199,322,521,843,1364,2207,3571, . .…”
Let {Ln} n≥0 be the sequence of Lucas numbers given by L0 = 2, L1 = 1 and Ln+2 = Ln+1 + Ln for all n ≥ 0. In this paper, for an integer d ≥ 2 which is square-free, we show that there is at most one value of the positive integer x participating in the Pell equation x 2 − dy 2 = ±1 which is a product of two Lucas numbers, with a few exceptions that we completely characterize.
“…In this paper, we study a similar problem to that of Kafle, et al [11], but with the Lucas numbers instead of the Fibonacci numbers. That is, we show that there is at most one value of the positive integer x participating in (1.3), which is a product of two Lucas numbers, with a few exceptions that we completely characterize.…”
Section: Resultsmentioning
confidence: 99%
“…This is sequence A000032 on the On-Line Encyclopedia of Integer Sequences (OEIS) [19]. The first few terms of this sequence are 3,4,7,11,18,29,47,76,123,199,322,521,843,1364,2207,3571, . .…”
Let {Ln} n≥0 be the sequence of Lucas numbers given by L0 = 2, L1 = 1 and Ln+2 = Ln+1 + Ln for all n ≥ 0. In this paper, for an integer d ≥ 2 which is square-free, we show that there is at most one value of the positive integer x participating in the Pell equation x 2 − dy 2 = ±1 which is a product of two Lucas numbers, with a few exceptions that we completely characterize.
“…In this paper, we study a problem related to that of Kafle et al [14] but with the Padovan sequence instead of the Fibonacci sequence. We also extend the results from the Pell equation (1) in the case = ±1 to the case = ±4.…”
Section: Resultsmentioning
confidence: 99%
“…In this paper, we let U := {P n P m : n ≥ m ≥ 0} be the sequence of products of two Padovan numbers. The first few members of U are U = {0, 1, 2, 3,4,5,6,7,8,9,10,12,14,15,16,18,20,21,24,25, 27, 28, 32, 35, . .…”
Let {P n } n≥0 be the sequence of Padovan numbers defined by P 0 = 0, P 1 = P 2 = 1, and P n+3 = P n+1 + P n for all n ≥ 0. In this paper, we find all positive square-free integers d ≥ 2 such that the Pell equations x 2 − dy 2 = , where ∈ {±1, ±4}, have at least two positive integer solutions (x, y) and (x , y ) such that each of x and x is a product of two Padovan numbers.
“…We mention a few such recent results; the interested reader may consult their references. In the papers [1,2,3,4,5,6,8,11,15,16,19] the authors provide various finiteness results concerning the values (or sums or products of values) of certain concrete recurrence sequences (such as Fibonacci, Tribonacci, generalized Fibonacci, Lucas, Padovan, Pell, repdigits) in the x coordinate of equation (1), for the cases t = ±1, ±4. Concerning the y-coordinate, we are aware only of two related results.…”
In this paper, we completely describe those recurrence sequences which have infinitely many terms in the solution sets of generalized Pell equations. Further, we give an upper bound for the number of such terms when there are only finitely many of them.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.