The terms Cxh(h≥3) in Lucas sequences: an algorithm and applications to diophantine equations
Paulo Ribenboim
Acta Arithmetica, Tome 108 (2003), p. 105-114 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 2003-01-01
EUDML-ID : urn:eudml:doc:277994 
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-aa106-2-1,
     author = {Paulo Ribenboim},
     title = {The terms $Cx^h (h $\geq$ 3)$ in Lucas sequences: an algorithm and applications to diophantine equations},
     journal = {Acta Arithmetica},
     volume = {108},
     year = {2003},
     pages = {105-114},
     zbl = {1162.11310},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-aa106-2-1}
}

Paulo Ribenboim. The terms $Cx^h (h ≥ 3)$ in Lucas sequences: an algorithm and applications to diophantine equations. Acta Arithmetica, Tome 108 (2003) pp. 105-114. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-aa106-2-1/