scientific article; zbMATH DE number 1305305

From MaRDI portal
Publication:4252174





Let the sequence of integers \(S_n\) be defined by the initial terms \(S_0\) and \(S_1\) and by the recursion \(S_{n+2} = PS_{n+1} - QS_n,\) for \(n \geq 0.\) Let \(H\) be a finite set of primes and \(H^*\) be the multiplicative semigroup generated by \(H.\) The reviewer proved in [J. Number Theory 15, 5-13 (1982; Zbl 0488.10009)] that the equation \(S_n = a x^t\) has only finitely many effectively computable solutions in integers \(n,a,x,t\) with \(|x|>1, t>1\) and \(a \in H^*\). The aim of this paper is to present a new, somewhat simpler proof of the above theorem and to give generalizations and applications of it. A typical result is: Let \(Q\in H^*, P \not= 0\) be such that \(P^2 \not= Q, 2Q, 3Q, 4Q\) and \(D = P^2 -4Q \in H^*\), let \(b \not= 0\) and \(n \geq 2.\) There exists an effectively computable constant \(C>0\), depending only on \(H, P, Q, n,b\) such that if \(4(QS_0^2 -PS_0S_1 +S_1^2) = b\) and \(S_0,S_1\) are not both equal to \(0\), if \(t \geq 2, |x|\geq 2, a\in H^*\) and \(S_n = ax^t\), then \(|x|,t, |a|, |S_0|, |S_1|<C.\) For the entire collection see [Zbl 0911.00025].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252174)