author = {I. Nemes},
title = {{On the solution of a diophantine equation with sieve algorithm}},
booktitle = {{Proceedings of the Colloquium on Computational Number Theory held at Kossuth Lajos University, Debrecen (Hungary), September 4-9, 1989}},
language = {english},
abstract = {We consider the Diophantine equation $G_{m}=P(x)$, with $G_{m}$ a second order linear recurrence sequence and $P(x)$ a polynomial over the integers and search the integral solutions $x$ and $m$. With the presented algorithm it is possible to exclude the majority of non solutions $m$, which are not greater than a given limit.},
pages = {302--319},
publisher = {Walter de Gruyter},
isbn_issn = {ISBN 3-11-012394-0},
year = {1991},
editor = {A. Pethö and M. E. Pohst and H. C. Williams and H. G. Zimmer},
refereed = {yes},
length = {18}