scientific article; zbMATH DE number 3875371

From MaRDI portal
Publication:3342641





\textit{H. London} and the reviewer [Fibonacci Q. 7, 476--481, 487 (1969; Zbl 0206.05402)] found all cubes in the Fibonacci sequence \(F_n\) by reducing this problem to solving the equations \(y^2 - 100 = x^3\) and \(y^2 + 100 = x^3\) with \(x\equiv y\equiv 0\pmod 5\) and \(x>0\), \(y>0\), and using algebraic number theory and Skolem's \(p\)-adic method. In the present paper the author gives a new solution of the equation (*) \(F_n = x^3\). This solution is effected by first reducing the problem to solving (**) \(A^3-3A^2B - 12AB^2+4B^3=\pm 1\). Then the author uses a deep result of \textit{M. Waldschmidt} [Acta Arith. 37, 257--283 (1980; Zbl 0357.10017)] to prove that any solution of (**) must satisfy \(\max\{| A|,| B|\}<5.172 \exp (0.6\cdot 10^{38}).\) From this it is easily deduced that \(n<3.76\cdot 10^{38}.\) Then the author uses a sieve technique to find all solutions of (*) less than this bound. Finally, the author uses his main result to show how to solve the equations \(F_n=px^3\) and \(F_n=p^2x^3\) for infinitely many primes \(p\). In conclusion, we note that perhaps the simplest solution of (*) was given by this reviewer [Fibonacci Q. 16, 451--459 (1978; Zbl 0393.10011)].











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 Q3342641)