On integral points on biquadratic curves and near-multiples of squares in Lucas sequences

From MaRDI portal
Publication:2877895

zbMATH Open1358.11141arXiv1306.0883MaRDI QIDQ2877895FDOQ2877895


Authors: Max A. Alekseyev, Szabolcs Tengely Edit this on Wikidata


Publication date: 28 August 2014

Published in: Journal of Integer Sequences (Search for Journal in Brave)

Abstract: We describe an algorithmic reduction of the search for integral points on a curve y^2 = ax^4 + bx^2 + c with nonzero ac(b^2-4ac) to solving a finite number of Thue equations. While existence of such reduction is anticipated from arguments of algebraic number theory, our algorithm is elementary and to best of our knowledge is the first published algorithm of this kind. In combination with other methods and powered by existing software Thue equations solvers, it allows one to efficiently compute integral points on biquadratic curves. We illustrate this approach with a particular application of finding near-multiples of squares in Lucas sequences. As an example, we establish that among Fibonacci numbers only 2 and 34 are of the form 2m^2+2; only 1, 13, and 1597 are of the form m^2-3; and so on. As an auxiliary result, we also give an algorithm for solving a Diophantine equation k^2 = f(m,n)/g(m,n) in integers m,n,k, where f and g are homogeneous quadratic polynomials.


Full work available at URL: https://arxiv.org/abs/1306.0883

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (8)

Uses Software





This page was built for publication: On integral points on biquadratic curves and near-multiples of squares in Lucas sequences

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