“…Returning back to (12) and (14) and using the fact that (x 1 , y 1 ) is the smallest positive solution to the Pell equation 1, we obtain…”
Section: The Final Reductionmentioning
confidence: 99%
“…Several other related problems have been studied where x k belongs to some interesting positive integer sequences. For example, see [2,5,6,7,9,11,12,13,14,15].…”
Let {F n } n≥0 be the sequence of Fibonacci numbers defined by F 0 = 0, F 1 = 1 and F n+2 = F n+1 + F n 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 = ±4 which is a sum of two Fibonacci numbers, with a few exceptions that we completely characterize.
“…Returning back to (12) and (14) and using the fact that (x 1 , y 1 ) is the smallest positive solution to the Pell equation 1, we obtain…”
Section: The Final Reductionmentioning
confidence: 99%
“…Several other related problems have been studied where x k belongs to some interesting positive integer sequences. For example, see [2,5,6,7,9,11,12,13,14,15].…”
Let {F n } n≥0 be the sequence of Fibonacci numbers defined by F 0 = 0, F 1 = 1 and F n+2 = F n+1 + F n 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 = ±4 which is a sum of two Fibonacci numbers, with a few exceptions that we completely characterize.
“…There are many other researchers who have studied related problems involving the intersection sequence {x n } n≥1 with linear recurrence sequences of interest. For example, see [4,8,7,9,12,13,14,16,17,20].…”
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.
“…This is sequence A000931 on the On-Line Encyclopedia of Integer Sequences (OEIS) [21]. The first few terms of this sequence are 3,4,5,7,9,12,16,21,28,37,49,65,86,114,151, . .…”
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.
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.