“…For second order recurrences we can bound effectively not only the exponents of the perfect powers appearing in the sequence, but also the largest index for which a term of the sequence can be a perfect power. This was proved by Shorey and Stewart [ShSt1] and independently by me [P1]. Theorem 7.…”
Section: Proof It Is Well Known Thatmentioning
confidence: 66%
“…There are results only in that case, when G n has a dominating characteristic zero. Under this assumption Shorey and Stewart [ShSt1] proved that q < c 2 provided |y| > 1.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
confidence: 99%
“…will denote effectively computable constants depending only on the initial terms and on the coefficients of the characteristic polynomial of G n . For binary recurrences Shorey and Stewart [ShSt1] and independently the author of the present notes [P1] proved that max{n, |y|, q} < c 1 . We come back to this result in section 2.3.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
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.
“…For second order recurrences we can bound effectively not only the exponents of the perfect powers appearing in the sequence, but also the largest index for which a term of the sequence can be a perfect power. This was proved by Shorey and Stewart [ShSt1] and independently by me [P1]. Theorem 7.…”
Section: Proof It Is Well Known Thatmentioning
confidence: 66%
“…There are results only in that case, when G n has a dominating characteristic zero. Under this assumption Shorey and Stewart [ShSt1] proved that q < c 2 provided |y| > 1.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
confidence: 99%
“…will denote effectively computable constants depending only on the initial terms and on the coefficients of the characteristic polynomial of G n . For binary recurrences Shorey and Stewart [ShSt1] and independently the author of the present notes [P1] proved that max{n, |y|, q} < c 1 . We come back to this result in section 2.3.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
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.
“…For instance, the combined work of Ljunggren [5] and Cohn [2] completely solved the equation T i = x 2 , in which it was shown that equation (2) implies that either i = 1 or i = 2, and that a solution exists for both i = 1, 2 only when d = 1785. More general results on polynomial values in linear recurrence sequences have been proved by Nemes and Pethö [9], and also by Shorey and Stewart [10].…”
Abstract. A particular case of a conjecture of Erdös and Graham, which concerns the number of integer points on a family of quartic curves, is investigated. An absolute bound for the number of such integer points is obtained.
“…We shall need the following theorem (see Shorey & Tijdeman [14], Shorey & Stewart [13], Pethő [9]), which we quote in the special case needed in this paper.…”
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.