“…(See [NP2,P4].) The situation changed with the papers [CZ1] and [CZ2]. In that papers Corvaja and Zannier proved similar results under quite general conditions.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
confidence: 96%
“…Much more interesting are the results of Corvaja and Zannier [CZ1] and [CZ2]. They considered in [CZ1] LRS with integer characteristic roots and proved: Let G n = g 1 a n 1 + · · · + g k a n k , where k ≥ 2, g 1 , .…”
Section: Proof It Is Well Known Thatmentioning
confidence: 99%
“…They considered in [CZ1] LRS with integer characteristic roots and proved: Let G n = g 1 a n 1 + · · · + g k a n k , where k ≥ 2, g 1 , . .…”
Abstract. Let Gn be a linear recursive sequence of integers and P (y) be a polynomial with integer coefficients. In this paper we are given a survey on results on the solutions of diophantine equation Gn = P (y). We prove especially that if Gn is of order three such that its characteristic polynomial is irreducible and has a dominating root then there are only finitely many perfect powers in Gn.
“…(See [NP2,P4].) The situation changed with the papers [CZ1] and [CZ2]. In that papers Corvaja and Zannier proved similar results under quite general conditions.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
confidence: 96%
“…Much more interesting are the results of Corvaja and Zannier [CZ1] and [CZ2]. They considered in [CZ1] LRS with integer characteristic roots and proved: Let G n = g 1 a n 1 + · · · + g k a n k , where k ≥ 2, g 1 , .…”
Section: Proof It Is Well Known Thatmentioning
confidence: 99%
“…They considered in [CZ1] LRS with integer characteristic roots and proved: Let G n = g 1 a n 1 + · · · + g k a n k , where k ≥ 2, g 1 , . .…”
Abstract. Let Gn be a linear recursive sequence of integers and P (y) be a polynomial with integer coefficients. In this paper we are given a survey on results on the solutions of diophantine equation Gn = P (y). We prove especially that if Gn is of order three such that its characteristic polynomial is irreducible and has a dominating root then there are only finitely many perfect powers in Gn.
“…Thus, we arrived at the scenario where F b F c + 1 = x 2 has infinitely many integer solutions (b, c, x) with b < c ≤ 4b + 14. Now the Corvaja-Zannier method based on the Subspace Theorem (see [2]) leads to the conclusion that there exists a line parametrized as b = r 1 n + s 1 , c = r 2 n + s 2 for positive integers r 1 , r 2 and integers s 1 , s 2 , such that for infinitely many positive integers n, there exists an integer v n such that…”
Section: Proof Of Theorem 12mentioning
confidence: 99%
“…We take K = Q( √ 5). This is a real quadratic fields with two 1), (1, 2), (1, 3), (1, 4), (2, 0), (2, 1), (2, 2), (2, 3), (3,0), (3,1), (3,2), (4, 0), (4, 1), (5, 0).…”
Abstract. We show that there are only finitely many Diophantine quadruples, that is, sets of four positive integers {a 1 , a 2 , a 3 , a 4 } such that a i a j + 1 is a square for all 1 ≤ i < j ≤ 4, consisting of Fibonacci 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.