On the solution of the diophantine equation Gn=pz
Let Gn be a second order linear recursive sequence, which satisfy certain conditions, and p be a prime. In this paper we describe an algorithm with which one can compute all but possible one integer solutions n,z of the diophantine equation Gn=pz. In the exceptional case the algorithm gives an n such that Gn is the only possible further power of p. We give an upper bound for the running time too.
KeywordsIdeal Factor Integer Solution Diophantine Equation Acta Arith Recursive Sequence
Unable to display preview. Download preview PDF.
- F. Beukers, The generalized Ramanujan-Nagell equation, Ph.D. Thesis, University of Leiden, 1979.Google Scholar
- E.L. Cohen, The diophantine equation x2+11=3k and related questions, Math. Scand., 38 (1976), 240–246.Google Scholar
- P. Kiss and B.M. Phong, Divisibility properties in second order recurrences, Publ. Math. Debrecen, 26 (1979), 187–197.Google Scholar
- E. Lucas, Sur la théorie des nombres premiers, Atti R. Accad.Sc. Torino (math.) 11 (1875–76), 928–937.Google Scholar
- E. Lucas, Théorie des fonctions numériques simplements périodiques, Amer. J. Math., 1 (1878), 184–240, 289–321.Google Scholar
- M. Mignotte, On the automatic resolution of certain diophantine equations, EUROSAM 84, Lect. Notes in Computer Sc. 174, 378–385, Springer Verlag 1984.Google Scholar
- A. Schinzel, On two theorems of Gelfond and some of their applications, Acta Arith. 13 (1967), 177–236.Google Scholar