Abstract:For an integer k ≥ 2, let {F (k) n } n 2−k be the k-generalized Fibonacci sequence which starts with 0, . . . , 0, 1 (a total of k terms) and for which each term afterwards is the sum of the k preceding terms. 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 k-generalized Fibonacci number, with a couple of parametric exceptions which we completely characterise. This paper exte… Show more
“…(17) Furthermore, k ≤ n, for if not, we would then get that α n+1 ≤ δ n+1 ≤ δ k < α n+1 , a contradiction. Besides, given that k 1 < k 2 , we have by (6) and 16that…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…. In this paper, we let U := {F n + F m : n ≥ m ≥ 0} be the sequence of sums of two Fibonacci numbers. The first few members of U are U = {0, 1, 2, 3, 4, 5,6,7,8,9,10,11,13,14,15,16,18,21,22,23,24,26,29,34,35, . .…”
Section: Introductionmentioning
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.
“…(17) Furthermore, k ≤ n, for if not, we would then get that α n+1 ≤ δ n+1 ≤ δ k < α n+1 , a contradiction. Besides, given that k 1 < k 2 , we have by (6) and 16that…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…. In this paper, we let U := {F n + F m : n ≥ m ≥ 0} be the sequence of sums of two Fibonacci numbers. The first few members of U are U = {0, 1, 2, 3, 4, 5,6,7,8,9,10,11,13,14,15,16,18,21,22,23,24,26,29,34,35, . .…”
Section: Introductionmentioning
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.
“…Several other related problems have been studied where x k belongs to some interesting positive integer sequences. For example, see [8,9,11,12,[14][15][16]18].…”
Let $$ (P_{n})_{n\ge 0} $$
(
P
n
)
n
≥
0
be the sequence of Padovan numbers defined by $$ P_0=0 $$
P
0
=
0
, $$ P_1 = P_2=1$$
P
1
=
P
2
=
1
, and $$ P_{n+3}= P_{n+1} +P_n$$
P
n
+
3
=
P
n
+
1
+
P
n
for all $$ n\ge 0 $$
n
≥
0
. In this paper, we find all positive square-free integers d such that the Pell equations $$ x^2-dy^2 = N $$
x
2
-
d
y
2
=
N
with $$ N\in \{\pm 1, \pm 4\} $$
N
∈
{
±
1
,
±
4
}
, have at least two positive integer solutions (x, y) and $$(x^{\prime }, y^{\prime })$$
(
x
′
,
y
′
)
such that both x and $$x^{\prime }$$
x
′
are sums 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.